๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Approximation Algorithms for Orienteering and Discounted-Reward TSP

โœ Scribed by Blum, Avrim; Chawla, Shuchi; Karger, David R.; Lane, Terran; Meyerson, Adam; Minkoff, Maria

Book ID
118180716
Publisher
Society for Industrial and Applied Mathematics
Year
2007
Tongue
English
Weight
225 KB
Volume
37
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Approximation algorithms for time-depend
Approximation algorithms for time-dependent orienteering
โœ Fedor V. Fomin; Andrzej Lingas ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 73 KB

The time-dependent orienteering problem is dual to the time-dependent traveling salesman problem. It consists of visiting a maximum number of sites within a given deadline. The traveling time between two sites is in general dependent on the starting time. For any ฮต > 0, we provide a (2 + ฮต)-approxi

Approximation algorithms for the Euclide
Approximation algorithms for the Euclidean bipartite TSP
โœ Andreas Baltz; Anand Srivastav ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 214 KB

We study approximation results for the Euclidean bipartite traveling salesman problem (TSP). We present the first worstcase examples, proving that the approximation guarantees of two known polynomial-time algorithms are tight. Moreover, we propose a new algorithm which displays a superior average ca

An approximation algorithm for the TSP
An approximation algorithm for the TSP
โœ J.M. Basart; L. Huguet ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 584 KB
A 78-approximation algorithm for metric
A 78-approximation algorithm for metric Max TSP
โœ Refael Hassin; Shlomi Rubinstein ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 66 KB

We present a randomized approximation algorithm for the metric version of undirected Max TSP. Its expected performance guarantee approaches 7 8 as n โ†’ โˆž, where n is the number of vertices in the graph.