An analysis of approximations for maximizing submodular set functions-I

Mathematical Programming

Volumn 14, Issue 1, 1978, Pages 265-294

  Nemhauser, G L ^a   Wolsey, L A ^a   Fisher, M L ^b  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Greedy Algorithm; Heuristics; Interchange Algorithm; Linear Programming; Matroid Optimization; Submodular Set Functions

Indexed keywords

EID: 0000095809     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/BF01588971     Document Type: Article

References (10)

1. Comments on the note of Frieze
2. Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms
3. Matroid partition
4. Submodular functions, matroids and certain polyhedra
5. Matroids and the greedy algorithm
6. A cost function property for plant location problems
7. Complements and substitutes in the optimal assignment problem
8. Cores of convex games
9. Plant location with generalized search origin