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

Celý popis

Podrobná bibliografia

Vydané v:	SIAM journal on computing Ročník 37; číslo 2; s. 653 - 670
Hlavní autori:	Blum, Avrim, Chawla, Shuchi, Karger, David R., Lane, Terran, Meyerson, Adam, Minkoff, Maria
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2007
Predmet:	Algorithms Approximation Computer science Expected values Graduate students Markov analysis Orienteering Probability distribution Random variables Robots Traveling salesman problem
ISSN:	0097-5397, 1095-7111
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!