Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem-Reference-Cited by-同舟云学术

Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem

Published:1998 Issue: Volume: Page:298-308
ISSN:0302-9743
Container-title:STACS 98
language:
Short-container-title:

Author:

Bshouty Nader H.,Burroughs Lynn

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0028569

Reference11 articles.

1. R. Bar-Yehuda and S. Even. A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics vol 25, (1985), 27–45.

2. M. Goemans and D. Williamson..878-Approximation Algorithms for MAX CUT and MAX 2SAT. Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing (1994), 422–431.

3. M. Goemans and D. Williamson. New 3/4-Approximation Algorithms for MAX SAT. SIAM Journal of Discrete Mathematics, 7 (1994), 656–666.

4. J. Håstad. Some Optimal Inapproximability Results. To appear in the Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing (1997).

5. D. Hochbaum. Approximation Algorithms for Set Covering and Vertex Cover Problems. SIAM Journal on Computing 11 (1982), 555–556.

Cited by 33 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective;Theory of Computing Systems;2023-12-01

2. On Colorful Vertex and Edge Cover Problems;Algorithmica;2023-08-30

3. Approximating Power Node-Deletion Problems;Lecture Notes in Computer Science;2023

4. A Parameterized Approximation Scheme for Generalized Partial Vertex Cover;Lecture Notes in Computer Science;2023

5. A primal-dual approximation algorithm for the k-prize-collecting minimum vertex cover problem with submodular penalties;Frontiers of Computer Science;2022-10-22