Approximation Algorithms for Orienteering and Discounted-Reward TSP
- 1 January 2007
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 37 (2), 653-670
- https://doi.org/10.1137/050645464
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- A Constant-Factor Approximation Algorithm for thek-MST ProblemJournal of Computer and System Sciences, 1999
- New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting SalesmenSIAM Journal on Computing, 1998
- Reinforcement Learning: A SurveyJournal of Artificial Intelligence Research, 1996
- A General Approximation Technique for Constrained Forest ProblemsSIAM Journal on Computing, 1995
- A note on the prize collecting traveling salesman problemMathematical Programming, 1993
- The prize collecting traveling salesman problemNetworks, 1989
- The orienteering problemNaval Research Logistics (NRL), 1987