Approximation algorithms for minimum weight partial connected set cover problem-Reference-Cited by-同舟云学术

Approximation algorithms for minimum weight partial connected set cover problem

Published:2014-08-20 Issue:2 Volume:31 Page:696-712
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Liang Dongyue,Zhang Zhao,Liu Xianliang,Wang Wei,Jiang Yaolin

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-014-9782-5.pdf

Reference21 articles.

1. Bar-Yehuda R (1999) Using homogeneous weights for approximating the partial cover problem. In: Proceeding of tenth annual ACM-SIAM symposium on discrete algorithms, pp 71–75

2. Bshouty N, Burroughs L (1998) Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem. In: Proceedings of annual symposium on the theoretical aspects of computer science, pp 298–308

3. Chvatal V (1979) A greedy heuristic for the set covering problem. Math Oper Res 4:233–235

4. Elbassioni K, Jelic S, Matijevic D (2012) The relation of connected set cover and group Steiner tree. Theor Comput Sci 438:96–101

5. Feige U (1998) A threshold of $$\ln n$$ ln n for approximating set cover. J ACM 45(4):634–652

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

1. Note on Dominating Set Problems;Journal of Communications Technology and Electronics;2021-12

2. A simple approximation algorithm for minimum weight partial connected set cover;Journal of Combinatorial Optimization;2017-03-10