Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. A. Agrawal, P. Klein, and R. Ravi. When trees collide: an approximation algorithm for the generalized steiner problem in networks. Proc. 23rd ACM Symp. on Theory of Computing, pages 134–144, 1991.
2. V. Bafna, P. Berman, and T. Fujito. Constant ratio approximation of the weighted feedback vertex set problem for undirected graphs. ISAAC '95 Algorithms and Computation, (1004):142–151, 1995.
3. R. Bar-Yehuda and S. Even. A linear time approximation algorithm for the weighted vertex cover problem. Journal 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–46, 1985.
5. R. Bar-Yehuda. A linear time 2-approximation algorithm for the min clique-complement problem. Technical Report CS0933, Technion Haifa, May 1998.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献