On approximation of the submodular set cover problem

Operations Research Letters

Volumn 25, Issue 4, 1999, Pages 169-174

  Fujito, Toshihiro ^a  

^a NAGOYA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; HEURISTIC METHODS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

HYPERGRAPHS; PARTIAL VERTEX COVERS; PRIMAL-DUAL HEURISTICS;

OPERATIONS RESEARCH;

EID: 0033356670     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(99)00045-0     Document Type: Article

References (15)

1. R. Bar-Yehuda, Using homogeneous weights for approximating the partial cover problem, in: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999, pp. 71-75.
2. D. Bertsimas, C.-P. Teo, From valid inequalities to heuristics: a unified view of primal-dual approximation algorithms in covering problems, in: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 102-111.
3. N.H. Bshouty, L. Burroughs, Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem, in: Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science, 1998, pp. 298-308.
4. Chvátal V. A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3):1979;233-235.
5. Dobson G. Worst-case analysis of greedy heuristics for integer programming with nonnegative data. Math. Oper. Res. 7(4):1982;515-531.
6. U. Feige, A threshold of ln n for approximating set cover, in: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 314-318.
7. T. Fujito, A unified local ratio approximation of node-deletion problems, in: ESA'96, 4th European Symposium on Algorithms, Lecture Notes in Computer Science, Vol. 1136, Springer, Berlin, 1996, pp. 167-178.
8. Hochbaum D.S. Approximation algorithms for the set covering and vertex cover problems. SIAM J. Comput. 11:1982;555-556.
9. Johnson D.S. Approximation algorithms for combinatorial problems. J. Comput. System Sci. 9:1974;256-278.
10. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller, J.W. Thatcher (Eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85-103.
11. M.J. Kearns, The Computational Complexity of Machine Learning, MIT Press, Cambridge, MA, 1990.
12. Lovász L. On the ratio of optimal integral and fractional covers. Discrete Math. 13:1975;383-390.
13. L. Lovász, Submodular functions and convexity, in: A. Bachem, M. Grötschel, B. Korte (Eds.), Mathematical Programming - The State of the Art, Springer, Berlin, 1983, pp. 235-257.
14. Slavík P. Improved performance of the greedy algorithm for partial cover. Inform. Process. Lett. 64(5):1997;251-254.
15. Wolsey L.A. An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica. 2(4):1982;385-393.