Approximation algorithms for deadline-TSP and vehicle routing with time-windows
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Algorithms for the on-line quota traveling salesman problem
Information Processing Letters
Saving an epsilon: a 2-approximation for the k-MST problem in graphs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A Recursive Greedy Algorithm for Walks in Directed Graphs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The orienteering problem in the plane revisited
Proceedings of the twenty-second annual symposium on Computational geometry
Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios
Transportation Science
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Directed Minimum Latency Problem
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Efficient informative sensing using multiple robots
Journal of Artificial Intelligence Research
Efficient planning of informative paths for multiple robots
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Efficient viewpoint assignment for urban texture documentation
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
ACM Transactions on Algorithms (TALG)
ESA'07 Proceedings of the 15th annual European conference on Algorithms
To fill or not to fill: the gas station problem
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Approximation algorithms for the directed k-tour and k-stroll problems
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
To fill or not to fill: The gas station problem
ACM Transactions on Algorithms (TALG)
Pickup and delivery for moving objects on broken lines
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Minimum vehicle routing with a common deadline
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Hi-index | 0.00 |
In this paper, we give the first constant-factor approximation algorithm for the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivated by robot navigation. In both problems, we are given a graph with lengths on edgesand prizes (rewards) on nodes, and a start node s. In the Orienteering Problem, the goal is to find a path that maximizes the reward collected, subject to a hard limit on the total length of the path. In the Discounted-Reward TSP, instead of a length limit we are given a discountfactor 驴, and the goal is to maximize total discounted reward collected, where reward for a node reached at time t is discounted by 驴t. This is similar to the objective considered in Markov Decision Processes (MDPs) except we only receive a reward the first time a node is visited. We also consider tree and multiple-path variants of these problems and provide approximations for those as well. Although the unrooted orienteering problem, where there is no fixed start node s, has been known to be approximable using algorithms for related problems such as k-TSP (in which the amount of reward to be collected is fixed and the total length is approximately minimized), ours is the first to approximate the rooted question, solving an open problem [3, 1].