Subject
General Computer Science,Theoretical Computer Science
Reference18 articles.
1. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, Proceedings of the 33rd FOCS, IEEE, Los Alamitos, 1992, pp. 14–23.
2. V. Bafna, P. Berman, T. Fujito, Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs, Proceedings of the sixth ISAAC, Lecture Notes in Computer Science, vol. 1004, Springer, Berlin, 1995, pp. 142–151.
3. R. Bar-Yehuda, S. Even, A local-ratio theorem for approximating the weighted vertex cover problem, Annals of Discrete Mathematics, vol. 25, North-Holland, Amsterdam, 1985, pp. 27–46.
4. R. Bar-Yehuda, D. Geiger, J. Naor, R.M. Roth, Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference, Proceedings of the fifth SODA, ACM, New York, 1994, pp. 344–354.
5. A. Becker, D. Geiger, Approximation algorithms for the loop cutset problem, Proceedings of the 10th Conference on Uncertainty in AI, Morgan Kaufman, 1994, pp. 60–68.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献