Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference12 articles.
1. R. Bar-Yehuda, One for the price of two: A unified approach for approximating covering problems, in, APPROX'98, 1st International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, July 1998, Algorithmica, to appear.
2. A linear time approximation algorithm for the weighted vertex cover problem;Bar-Yehuda;J. Algorithms,1981
3. A local-ratio theorem for approximating the weighted vertex cover problem;Bar-Yehuda;Ann. Discrete Math.,1985
4. N. Bshouty and L. Burroughs, Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem, inThe Proceedings of the Fifteenth Annual Symposium on the Theoretical Aspects of Computer Science, 1998, pp. 298–308.
5. L. Burroughs, Approximation Algorithms for Covering Problems, Master's thesis, University of Calgary, February 1998.
Cited by
60 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献