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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on computing Jg. 37; H. 2; S. 653 - 670
Hauptverfasser:	Blum, Avrim, Chawla, Shuchi, Karger, David R., Lane, Terran, Meyerson, Adam, Minkoff, Maria
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2007
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!