共 21 条
[1]
Bar-Yehuda R.(2001)Using homogeneous weights for approximating the partial cover problem J. Algorithms 39 137-144
[2]
Bar-Yehuda R.(1981)A linear time approximation algorithm for approximating the weighted vertex cover J. Algorithms 2 198-203
[3]
Even S.(1985)A local-ratio theorem for approximating the weighted vertex cover problem Ann. Discret. Math. 25 27-46
[4]
Bar-Yehuda R.(1983)A modification of the greedy algorithm for vertex cover Inf. Process. Lett. 16 23-25
[5]
Even S.(2004)Approximation algorithms for partial covering problems J. Algorithms 53 55-84
[6]
Clarkson K.L.(2006)Dependent rounding and its applications to approximation algorithms J. ACM 53 324-360
[7]
Gandhi R.(2003)Capacitated vertex covering J. Algorithms 48 257-270
[8]
Khuller S.(2002)Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs SIAM J. Comput. 31 1608-1623
[9]
Srinivasan A.(1982)Approximation algorithms for the set covering and vertex cover problems SIAM J. Comput. 11 555-556
[10]
Gandhi R.(2001)Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation J. ACM 48 274-296