Author:
Ran Yingli,Shi Yishuo,Zhang Zhao
Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference30 articles.
1. Bar-Yehuda R, Even S (1985) A local-ratio theorem for approximating the weighted vertex cover problem. Ann Discret Math 25:27–46
2. Bar-Yehuda R (2001) Using homogeneous weights for approximating the partial cover problem. J Algorithms 39:137–144
3. Bshouty NH, Burroughs L (1998) Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem. In: The proceedings of the 15th annual symposium on the theoretical aspects of computer science, pp 298–308
4. Chvatal V (1979) A greedy heuristic for the set-covering problem. Math Oper Res 4:233–235
5. Dinh TN, Shen Y, Nguyen DT, Thai MT (2014) On the approximability of positive influence dominating set in social networks. J Comb Optim 27:487–503
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献