The orienteering problem in the plane revisited

Proceedings of the Annual Symposium on Computational Geometry

Volumn 2006, Issue , 2006, Pages 247-253

  Chen, Ke ^a   Har Peled, Sariel ^a  

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

Author keywords

Approximation; k TSP; Orienteering problem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; CONSTRAINT THEORY; POLYNOMIALS;

APPROXIMATION ALGORITHM; K-TSP; ORIENTEERING PROBLEM; POLYNOMIAL TIME APPROXIMATION SCHEME (PTAS);

PROBLEM SOLVING;

EID: 33748067443     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1137856.1137893     Document Type: Conference Paper

References (11)

1. E. M. Arkin, J. S. B. Mitchell, and G. Narasimhan. Resource-constrained geometric network optimization. In Proc. 14th Annu. ACM Sympos. Comput. Geom., pages 307-316, 1998.
2. S. Arora, Polynomial time approximation schemes for euclidean tsp and other geometric problems. J. Assoc. Comput. Mach., 45(5):753-782, Sep 1998.
3. S. Arora. Approximation schemes for np-hard geometric optimization problems: a survey. Mathematical Programming, 97:43-69, 2003.
4. S. Arora and G. Karakostas. Approximation schemes for minimum latency problems. SIAM J. Comput., 32(5):1317-1337, 2003.
5. N. Bansal, A. Blum, S. Chawla, and A. Meyerson. Approximation algorithms for deadline-tsp and vehicle routing with time-windows. In Proc. 36th Annu. ACM Sympos. Theory Comput., pages 166-174, 2004.
6. R. Bar-Yehuda, G. Even, and S. Shahar. On approximating a geometric prize-collecting traveling salesman problem with time windows. J. Algorithms, 55(1):76-92, 2005.
7. A. Blum, S. Chawla, D. R. Karger, T. Lane, A. Meyerson, and M. Minkoff. Approximation algorithms for orienteering and discounted-reward tsp. In Proc. 44th Annu. IEEE Sympos. Found. Comput. Sci., pages 46-55, 2003.
8. C. Chekuri and M. Pál. A recursive greedy algorithm for walks in directed graphs. In Proc. 46th Annu. IEEE Sympos. Found. Comput. Sci., pages 245-253, 2005.
9. 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:1298-1309, 1999.
10. J. S. B. Mitchell, Geometric shortest paths and network optimization. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, chapter 15, pages 633-701. Elsevier, 2000.
11. P. Toth and D. Vigo, editors. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, 2002.