Author:
Safra Shmuel,Schwartz Oded
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Arkin, E., Hassin, R.: Approximation algorithms for the geometric covering salesman problem. DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science 55(3), 197–218 (1994)
2. Arora, S.: Polynomial-time approximation scheme for Euclidean TSP and other geometric problems. In: Proceedings of the Symposium on Foundations of Computer Science, pp. 2–11 (1996)
3. Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, Graduate School of Industrial Administration, Carnegy–Mellon University (1976)
4. Carlsson, S., Jonsson, H., Nilsson, B.J.: Finding the shortest watchman route in a simple polygon. GEOMETRY: Discrete X Computational Geometry 22(3), 377–402 (1999)
5. Chin, W., Ntafos, S.: Optimum watchman routes. Information. Processing Letters 28(1), 39–44 (1988)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献