Approximation algorithms for orienteering and discounted-reward TSP

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 46-55

  Blum, Avrim ^a   Chawla, Shuchi ^a   Karger, David R ^b   Lane, Terram ^c   Meyerson, Adam ^a   Minkoft, Maria ^b  

^a Carnegie Mellon University ^*  (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c MSC01 1070   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DECISION THEORY; DYNAMIC PROGRAMMING; MARKOV PROCESSES; MOTION PLANNING; ROBOTICS; TRAVELING SALESMAN PROBLEM;

APPROXIMATION ALGORITHMS; DISCOUNTED REWARD PROBLEM; ORIENTEERING PROBLEM; PRIZE COLLECTIVE PROBLEM;

ALGORITHMS;

EID: 0344981507     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. E. M. Arkin, J. S. B. Mitchell, and G. Narasimhan. Resource-constrained geometric network optimization. In Symposium on Computational Geometry, pages 307-316, 1998.
2. S. Arora and G. Karakostas. A 2 + ε approximation algorithm for the k-MST problem. In Symposium on Discrete Algorithms, pages 754-759, 2000.
3. B. Awerbuch, Y. Azar, A. Blum, and S. Vempala. Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. Siam J. Computing, 28(1):254-262, 1999.
4. E. Balas. The prize collecting traveling salesman problem. Networks, 19:621-636, 1989.
5. D. P. Bertsekas. Dynamic Programming and Optimal Control. Athena Scientific, 1995.
6. D. P. Bertsekas and J. N. Tsitsiklis. Neural Dynamic Programming. Athena Scientific, 1996.
7. A. Blum, R. Ravi, and S. Vempala. A constant-factor approximation algorithm for the k-MST problem. JCSS, 58:101-108, 1999.
8. K. Chaudhuri, B. Godfrey, S. Rao, and K. Talwar. Paths, trees, and minimum latency tours. In Proceedings of the 44th Annual Symposium on Foundations of Computer Science, Cambridge, Massachusetts, 2003.
9. N. Garg. A 3-approximation for the minimum tree spanning k vertices. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pages 302-309, October 1996.
10. M. Goemans and D. Williamson. A general approximation technique for constrained forest problems. In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 307-315, 1992.
11. M.X. Goemans and D.P. Williamson, A general approximation techniques for constrained forest problems. SIAM J. Comput., 24:296-317, 1995.
12. B.L. Golden, L. Levy, and R. Vohra. The orienteering problem. Naval Research Logistics, 34:307-318, 1987.
13. D. Johnson, M. Minkoff, and S. Phillips. The prize collecting steiner tree problem: Theory and practice. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 760-769, 2000.
14. L. P. Kaelbling, M. L. Littman, and A. W. Moore. Reinforcement learning: A survey. Journal of Artificial Intelligence Research, 4, 1996.
15. T. Lane and L. P. Kaelbling. Approaches to macro decompositions of large markov decision process planning problems. In Proceedings of the 2001 SPIE Conference on Mobile Robotics, Newton, MA, 2001. SPIE.
16. T. Lane and L. P. Kaelbling. Nearly deterministic abstractions of markov decision processes. In Proceedings of the Eighteenth National Conference on Artificial Intelligence, Edmonton, 2002.
17. M. L. Puterman. Markov Decision Processes. Wiley, 1994.
18. R. S. Sutton and A. G. Barto. Reinforcement Learning: An Introduction. MIT Press, 1998.