Author:
Gandhi Rajiv,Khuller Samir,Srinivasan Aravind
Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. N. Alon, R. Boppana and J. H. Spencer. An asymptotic isoperimetric inequality. Geometric and Functional Analysis, 8:411–436, 1998.
2. B. Baker. Approximation Algorithms for NP-Complete Problems on Planar Graphs. JACM, Vol 41 (1), (1994), pp. 153–190.
3. R. Bar-Yehuda and S. Even. A linear time approximation algorithm for the weighted vertex cover problem. J. of Algorithms 2:198–203, 1981.
4. R. Bar-Yehuda and S. Even. A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics, 25:27–45, 1985.
5. R. Bar-Yehuda. Using homogeneous weights for approximating the partial cover problem. In Proc. Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 71–75, 1999.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献