𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems

✍ Scribed by Greg N. Frederickson; Barry Wittman

Book ID
106149202
Publisher
Springer
Year
2011
Tongue
English
Weight
774 KB
Volume
62
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Differential approximation results for t
Differential approximation results for the traveling salesman and related problems
✍ JΓ©rΓ΄me Monnot πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 90 KB

This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and cannot be differential approximable greater than 649/650. Next, we demonstrate that, when dealing with edge-costs 1 and 2, the same algorithm ide