✦ LIBER ✦

Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem

✍ Scribed by N. Guttmann-Beck; R. Hassin; S. Khuller; B. Raghavachari

Publisher: Springer
Year: 2000
Tongue: English
Weight: 111 KB
Volume: 28
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s004530010045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation algorithms for the traveli

Approximation algorithms for the traveling salesman problem

✍ Jérôme Monnot; Vangelis Th. Paschos; Sophie Toulouse 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 200 KB

Guaranteed performance heuristics for th

Guaranteed performance heuristics for the bottleneck travelling salesman problem

✍ R.Gary Parker; Ronald L Rardin 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 367 KB

Approximation algorithms for the capacit

Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries

✍ Shoshana Anily; Julien Bramel 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB 👁 2 views

We consider the Capacitated Traveling Salesman Problem with Pickups and Deliveries (CTSPPD). This problem is characterized by a set of n pickup points and a set of n delivery points. A single product is available at the pickup points which must be brought to the delivery points. A vehicle of limited

On the relationship of approximation alg

On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem

✍ Frank Korner 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 249 KB

On the worst-case performance of some al

On the worst-case performance of some algorithms for the asymmetric traveling salesman problem

✍ A. M. Frieze; G. Galbiati; F. Maffioli 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 657 KB

An approximation algorithm for the asymm

An approximation algorithm for the asymmetric travelling salesman problem with distances one and two

✍ Sundar Vishwanathan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 501 KB