Using Homogeneous Weights for Approximating the Partial Cover Problem

Journal of Algorithms

Volumn 39, Issue 2, 2001, Pages 137-144

  Bar Yehuda, Reuven ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Approximation algorithm; Covering problems; Knapsack; Local ratio; Partial covering; Set cover; Vertex cover

Indexed keywords

EID: 0003433917     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1150     Document Type: Article

References (12)

1. R. Bar-Yehuda, One for the price of two: A unified approach for approximating covering problems, in "APPROX'98, 1st International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, July 1998," Algorithmica, to appear.
2. R. Bar-Yehuda and S. Even, A linear time approximation algorithm for the weighted vertex cover problem, J. Algorithms 2 (1981), 198-203.
3. R. Bar-Yehuda and S. Even, A local-ratio theorem for approximating the weighted vertex cover problem, Ann. Discrete Math. 25 (1985), 27-46.
4. N. Bshouty and L. Burroughs, Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem, in "The Proceedings of the Fifteenth Annual Symposium on the Theoretical Aspects of Computer Science, 1998," pp. 298-308.
5. L. Burroughs, "Approximation Algorithms for Covering Problems," Master's thesis, University of Calgary, February 1998.
6. V Chvátal, A greedy heuristic for the set-covering problem, Math. Oper. Res. 4, No. 3 (1979), 233-235.
7. M. Garey and D. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, San Francisco, 1979.
8. D. S. Hochbaum, The t-vertex cover problem: Extending the half integrality framework with budget constraints, in "APPROX'98 1st International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, 1998," pp. 111-122.
9. M. Kearns, "The Computational Complexity of Machine Learning," M.I.T. Press, Cambridge, MA, 1990.
10. S. Khuller, A. Moss, and J. Naor, The budgeted maximum coverage problem, submitted for publication 1998.
11. G. L. Nemhauser and J. L. E. Trotter, Vertex packings: Structural properties and algorithms, Math. Programming 8 (1975), 232-248.
12. P. Slavík, Improved performance of the greedy algorithm for partial cover, Inform. Process. Lett. 64, No. 5 (15 Dec. 1997), 251-254.