The euclidean orienteering problem revisited

SIAM Journal on Computing

Volumn 38, Issue 1, 2008, Pages 385-397

  Ke, Chen ^a   Sariel, Har Peled ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Approximation algorithms; k TSP; Orienteering problem; PTAS

Indexed keywords

EUCLIDEAN; HIGHER DIMENSIONS; K-TSP; LENGTH CONSTRAINTS; OPTIMAL SOLUTIONS; ORIENTEERING PROBLEM; ORIENTEERING PROBLEMS; POLYNOMIAL TIME APPROXIMATION SCHEMES; PTAS;

POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 55249116793     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/060667839     Document Type: Article

References (12)

1. S. ARORA AND G. KARAKOSTAS, Approximation schemes for minimum latency problems, SIAM J. Comput., 32 (2003), pp. 1317-1337.
2. E. M. ARKIN, J. S. B. MITCHELL, AND G. NARASIMHAN, Resource-constrained geometric network optimization, in Proceedings of the 14th Annual ACM Symposium on Computational Geometry, 1998, pp. 307-316.
3. S. ARORA, Polynomial time approximation schemes for Euclidean TSP and other geometric problems, J. ACM, 45 (1998), pp. 753-782.
4. S. ARORA, Approximation schemes for NP-hard geometric optimization problems: A survey, Math. Program, 97 (2003), pp. 43-69.
5. N. BANSAL, A. BLUM, S. CHAWLA, AND A. MEYERSON, Approximation algorithms for deadline-TSP and vehicle routing with time-windows, in Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004, pp. 166-174.
6. A. BLUM, S. CHAWLA, D. R. KARGER, T. LANE, A. MEYERSON, AND M. MINKOFF, Approximation algorithms for orienteering and discounted-reward TSP, in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003, pp. 46-55.
7. R. BAR-YEHUDA, G. EVEN, AND S. SHAHAR, On approximating a geometric prize-collecting traveling salesman problem with time windows, J. Algorithms, 55 (2005), pp. 76-92.
8. C. CHEKURI AND M. PÁL, A recursive greedy algorithm for walks in directed graphs, in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005, pp. 245-253.
9. N. GARG, Saving an epsilon: A 2-approximation for the k-MST problem in graphs, in Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005, pp. 396-402.
10. J. S. B. MITCHELL, Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and, related problems, SIAM J. Comput., 28 (1999), pp. 1298-1309.
11. J. S. B. MITCHELL, Geometric shortest paths and network optimization, in Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, eds., North-Holland, Amsterdam, 2000, pp. 633-701.
12. P. TOTH AND D. VIGO, EDS., The Vehicle Routing Problem, SIAM Monogr. Discrete Math. Appl. 9, SIAM, Philadelphia, 2002.