Author:
Clementi Andrea E. F.,Trevisan Luca
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. S. Arora, D. Karger, and M. Karpinski. Polynomial time approximation schemes for dense instances of graph problems. In Proceedings of the 27th ACM Symposium on Theory of Computing, pages 284–293, 1995.
2. S. Arora and S. Safra. Probabilistic checking of proofs; a new characterization of NP. In Proceedings of 33rd Symposium on Foundations of Computer Science, pages 2–13, 1992.
3. M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCP's and non-approximability — towards tight results (3rd version). Technical Report TR95-24, Electronic Colloquium on Computational Complexity, 1995. Extended abstract in Proc. of FOCS'95.
4. P. Berman and T. Fujito. On the approximation properties of the independent set problem in degree 3 graphs. In Proceedings of the 4th Workshop on Algorithms and Data Structures, pages 449–460. LNCS 955, Springer-Verlag, 1995.
5. M. Bern and P. Plassmann. The steiner tree problem with edge lengths 1 and 2. Information Processing Letters, 32:171–176, 1989.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献