The Generalized Maximum Coverage Problem
- 15 September 2008
- journal article
- research article
- Published by Elsevier BV in Information Processing Letters
- Vol. 108 (1), 15-22
- https://doi.org/10.1016/j.ipl.2008.03.017
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- An efficient approximation for the Generalized Assignment ProblemInformation Processing Letters, 2006
- Tight approximation algorithms for maximum general assignment problemsPublished by Association for Computing Machinery (ACM) ,2006
- Budgeted Maximum Graph CoverageLecture Notes in Computer Science, 2002
- Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of PartsLecture Notes in Computer Science, 1999
- The budgeted maximum coverage problemInformation Processing Letters, 1999
- An approximation algorithm for the generalized assignment problemMathematical Programming, 1993