A note on maximizing a submodular set function subject to a knapsack constraint

Operations Research Letters

Volumn 32, Issue 1, 2004, Pages 41-43

  Sviridenko, Maxim ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Approximation algorithm; Submodular function

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FUNCTIONS;

SUBMODULAR FUNCTIONS;

OPERATIONS RESEARCH;

EID: 0142029543     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(03)00062-2     Document Type: Article

References (8)

1. Feige U. A threshold of. ln n for approximating set cover J. ACM. 45:1998;634-652.
2. A. Hoffman, J. Lee, J. Williams, New upper bounds for maximum-entropy sampling, mODa 6 - advances in model-oriented design and analysis (Puchberg/Schneeberg, 2001) Contributory Statististics, Physica, Heidelberg, 2001, pp. 143-153.
3. Khuller S., Moss A., Naor J. The budgeted maximum coverage problem. Inform. Process. Lett. 70:1999;39-45.
4. Ko Chun-Wa, Lee J., Queyranne M. An exact algorithm for maximum entropy sampling. Oper. Res. 43:1995;684-691.
5. Lee J. Constrained maximum-entropy sampling. Oper. Res. 46:1998;655-664.
6. Nemhauser G.L., Wolsey L.A., Fisher M.L. An analysis of approximations for maximizing submodular set functions-1. Math. Programming. 14:1978;265-294.
7. Sahni S. Approximate algorithms for the 0/1 knapsack problem. J. ACM. 22:1975;115-124.
8. Wolsey L.A. Maximising real-valued submodular functions. primal and dual heuristics for location problems Math. Oper. Res. 7:1982;410-425.