Approximating the dense set-cover problem-Reference-Cited by-同舟云学术

Approximating the dense set-cover problem

Published:2004-12 Issue:4 Volume:69 Page:547-561
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Bar-Yehuda Reuven,Kehat Zehavit

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference10 articles.

1. A linear time approximation algorithm for the weighted vertex cover problem;Bar-Yehuda;J. Algorithms,1981

2. A local-ratio theorem for approximating the weighted vertex cover problem;Bar-Yehuda;Ann. Discrete Math,1985

3. A. Eremeev, On some approximation algorithms for dense vertex cover problem, Proceedings of SOR’99, Springer, 2000, pp. 58–62.

4. E. Halperin, Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs, Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, 2000.

5. Approximation algorithms for the set covering and vertex cover problems;Hochbaum;SIAM J. Comput,1982

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

1. Nearly tight approximation bounds for vertex cover on dense k-uniform k-partite hypergraphs;Journal of Discrete Algorithms;2015-07

2. Approximating vertex cover in dense hypergraphs;Journal of Discrete Algorithms;2012-05

3. Approximating edge dominating set in dense graphs;Theoretical Computer Science;2012-01

4. Minimum Interval Cover and Its Application to Genome Sequencing;Combinatorial Optimization and Applications;2011

5. Approximating Edge Dominating Set in Dense Graphs;Lecture Notes in Computer Science;2011