Approximation Algorithms for Orienteering and Discounted-Reward TSP

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 traveling salesman problem (TSP), motivated by robot navigation. In both problems, we are given a graph with lengths on edges and...

Full description

Bibliographic Details

Published in:	SIAM journal on computing Vol. 37; no. 2; pp. 653 - 670
Main Authors:	Blum, Avrim, Chawla, Shuchi, Karger, David R., Lane, Terran, Meyerson, Adam, Minkoff, Maria
Format:	Journal Article
Language:	English
Published:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2007
Subjects:	Algorithms Approximation Computer science Expected values Graduate students Markov analysis Orienteering Probability distribution Random variables Robots Traveling salesman problem
ISSN:	0097-5397, 1095-7111
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!