Author:
Bafna Vineet,Berman Piotr,Fujito Toshihiro
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. S. Arora, C. Lund, R. Motwani, and M. Sudan and M. Szegedy. Proof verification and intractability of approximation problems. In 33rd IEEE Symp. on Foundations of Computer Science, 1992.
2. Bar-Yehuda, R. and S. Even. A local-ratio theorem for approximating the weighted vertex cover problem. In Annals of Discrete Mathematics 25. North-Holland, 1985.
3. R. Bar-Yehuda, D. Geiger, J. Naor and R. M. Roth. Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference. In Proc. of the 5th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 344–354, 1994.
4. A. Becker and D. Geiger. Approximation algorithms for the loop cutset problem. In Uncertainity in Artificial Intelligence, 9, 1994.
5. P. Berman. [personal communication]
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献