Author:
Engebretsen Lars,Karpinski Marek
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. J. ACM, 45(3):501–555, 1998.
2. Lect Notes Comput Sci;P. Berman,1999
3. Lect Notes Comput Sci;H.-J. Böckenhauer,2000
4. H.-J. Böckenhauer and S. Seibert. Improved lower bounds on the approximability of the traveling salesman problem. RAIRO Theoretical Informatics and Applications, 34(3):213–255, 2000.
5. Technical Report CS-93-13;N. Christofides,1976
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献