The Generalized Maximum Coverage Problem

Information Processing Letters

Volumn 108, Issue 1, 2008, Pages 15-22

  Cohen, Reuven ^a   Katzir, Liran ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Approximation algorithms; Maximum coverage

Indexed keywords

POLYNOMIAL APPROXIMATION;

APPROXIMATION RATIOS; GREEDY ALGORITHMS; MAXIMUM COVERAGE;

APPROXIMATION ALGORITHMS;

EID: 48749131590     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.03.017     Document Type: Article

References (9)

1. A.A. Ageev, M. Sviridenko, Approximation algorithms for maximum coverage and max cut with given sizes of parts, in: IPCO, 1999, pp. 17-30
2. Cohen R., Katzir L., and Raz D. An efficient approximation for the generalized assignment problem. Inform. Process. Lett. 100 4 (2006) 162-166
3. L. Fleischer, M.X. Goemans, V.S. Mirrokni, M. Sviridenko, Tight approximation algorithms for maximum general assignment problems, in: SODA'06: Proceedings of the Sixtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006
4. Hochbaum D.S. Approximation Algorithms for NP-hard Problems (1997), PWS Publishing Co., Boston, MA, USA
5. Kellerer H., Pferschy U., and Pisinger D. Knapsack Problems (2004), Springer
6. Khuller S., Moss A., and Naor J. The budgeted maximum coverage problem. Inform. Process. Lett. 70 1 (1999) 39-45
7. S.O. Krumke, M.V. Marathe, D. Poensgen, S.S. Ravi, H.-C. Wirth, Budgeted maximum graph coverage, in: WG, 2002, pp. 321-332
8. H. Shachnai, T. Tamir, Polynomial time approximation schemes-a survey, in: Handbook of Approximation Algorithms and Metaheuristics, http://www.cs.technion.ac.il/~hadas/PUB/ptas.pdf
9. Shmoys D.B., and Tardos E. An approximation algorithm for the generalized assignment problem. Math. Program. 62 3 (1993) 461-474