Author:
Arkin Esther M.,Gao Jie,Hesterberg Adam,Mitchell Joseph S. B.,Zeng Jiemin
Publisher
Springer International Publishing
Reference19 articles.
1. Arkin, E.M., Hassin, R.: Approximation algorithms for the geometric covering salesman problem. Discrete Appl. Math. 55(3), 197–218 (1994)
2. Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753–782 (1998)
3. Arora, S., Chang, K.: Approximation schemes for degree-restricted MST and red-blue separation problems. Algorithmica 40(3), 189–210 (2004)
4. Chan, T.H., Jiang, S.H.: Reducing curse of dimensionality: improved PTAS for TSP (with neighborhoods) in doubling metrics. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, 10–12 January 2016, Arlington, VA, USA, pp. 754–765 (2016)
5. Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report 388, Graduate School of Industrial Administration, Carnegie Mellon University (1976)