One for the price of two: A unified approach for approximating covering problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1444, Issue , 1998, Pages 49-62

  Bar Yehuda, Reuven ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Approximation algorithm; Covering problems; Feedback vertex set; Generalized steiner forest; Local ratio; Randomized approximations; Set cover; Vertex cover

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; COSTS; FORESTRY; ITERATIVE METHODS; OPTIMIZATION;

COVERING PROBLEMS; FEEDBACK VERTEX SET; GENERALIZED STEINER FORESTS; LOCAL RATIO; RANDOMIZED APPROXIMATION; SET COVER; VERTEX COVER;

APPROXIMATION ALGORITHMS;

EID: 84958976498     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0053963     Document Type: Conference Paper

References (21)

1. A. Agrawal, P. Klein, and R. Ravi. When trees collide: an approximation algorithm for the generalized steiner problem in networks. Proc. 23rd A CM Syrup. on Theory of Computing, pages 134-144, 1991.
2. V. Bafna, P. Berman, and T. Fujito. Constant ratio approximation of the weighted feedback vertex set problem for undirected graphs. ISAAC '95 Algorithms and Computation, (1004):142-151, 1995.
3. R. Bar-Yehuda and S. Even. A linear time approximation algorithm for the weighted vertex cover problem. Journal o] Algorithms, 2:198-203, 1981.
4. R. Bar-Yehuda and S. Even. A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics, 25:27-46, 1985.
5. R. Bar-Vehuda. A linear time 2-approximation algorithm for the min cliquecomplement problem. Technical Report CS0933, Technion Haifa, May 1998.
6. R. Bar-Yehuda. Partial vertex cover problem and its generalizations. Technical Report CS0934, Technion Haifa, May 1998.
7. R. Bar-Yehuda, D. Geiger, J. Naor, and R. Roth. Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and bayesian inference. Accepted to SIAM J. on Computing, 1997.
8. R. Bar-Yehuda and D. Rawitz. Generalized algorithms for bounded integer programs with two variables per constraint. Technical Report CS0935, Technion Haifa, May 1998.
9. A. Becker and D. Geiger. Approximation algorithms for the loop cutset problem. Proc. 10th Conf. on Uncertainty in Artificial Intelligence, pages 60-68, 1994.
10. F. Chudak, M. Goemans, D. Hochbaum, and D. Williamson. A primal-dual interpretation of recent 2-approximation algorithms for the feedback vertex set problem in undirected graphs. Unpublished, 1996.
11. V. Chvatal. A greedy heuristic for the set-covering problem. Math. of Oper. Res., 4(3):233-235, 1979.
12. K. Clarkson. A modification of the greedy algorithm for the vertex cover. Info. Proc. Lett., 16:23-25, 1983.
13. T. Fujito. A unified local ratio approximation of node-deletion problems. ESA, Barcelona, Spain, pages 167-178, September 1996.
14. M. Garey and D. Johnson. Computers and Intractability. W.H. Freeman, 1979.
15. M. Goemans and D. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24(2):296-317, 1995.
16. M. Goemans and D. Williamson. The primal-dual method for approximation algorithms and its application to network design problems. Approximation Algorithms for NP-Hard Problems, 4, 1996.
17. D. Hochbaum. Approximating covering and packing problems: Set cover, vertex cover, independent set, and related problems. Chapter 3 in Approximation Algorithms for NP-Hard Problems, PWS Publication Company, 1997.
18. G. Nemhauser and J. L.E. Trotter. Vertex packings: structural properties and algorithms. Mathematical Programming, 8:232-248, 1975.
19. V. T. Paschos. A survey of approximately optimal solutions to some covering and packing problems. ACM Computing Surveys, 29(2):171-209, June 1997.
20. L. Pitt. Simple probabifistic approximation algorithm for the vertex cover problem. Technical Report, Yale, June 1984.
21. D. Williamson, M. Goemans, M. Mihail, and V. Vazirani. A primal-dual approximation algorithm for generalized steiner network problems. Combinatorica, 15:435-454, 1995.