Author:
Böckenhauer Hans-Joachim,Hromkovič Juraj,Klasing Ralf,Seibert Sebastian,Unger Walter
Subject
General Computer Science,Theoretical Computer Science
Reference24 articles.
1. T. Andreae, On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality, Technical Report 74, Mathematisches Seminar, University of Hamburg, 1998.
2. Performance guarantees for approximation algorithms depending on parametrized triangle inequalities;Andreae;SIAM J. Discrete Math.,1995
3. S. Arora, Polynomial time approximation schemes for Euclidean TSP and other geometric problems, Proc. 37th IEEE FOCS, 1996, pp. 2–11.
4. S. Arora, Nearly linear time approximation schemes for Euclidean TSP and other geometric problems, Proc. 38th IEEE FOCS, 1997, pp. 554–563.
5. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems;Arora;J. Assoc. Comput. Mach.,1998
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献