Author:
Berman Piotr,Fujito Toshihiro
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof verification and intractability of approximation problems. In 33rd IEEE Symp. on Foundations of Computer Science, 1992.
2. B.S. Baker. Approximation algorithms for NP-complete problems on planar graphs. Journal of the Association for Computing Machinery, 41:153–180, 1994.
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. P. Berman and M. Fürer. Approximating maximum independent set in bounded degree graphs. In Proc. of the 5th Annual ACM-SIAM Symp. on Discrete Algorithms, 1994.
5. R.L. Brooks. On coloring the nodes of a network. In Proc. Cambridge Philos. Soc., volume 37, pages 194–197, 1941.
Cited by
49 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献