Product details:
| ISBN13: | 9781009445412 |
| ISBN10: | 1009445413 |
| Binding: | Hardback |
| No. of pages: | 439 pages |
| Language: | English |
| 700 |
Category:
Approximation Algorithms for Traveling Salesman Problems
Publisher: Cambridge University Press
Date of Publication: 31 December 2024
Normal price:
Publisher's listprice:
GBP 125.00
GBP 125.00
Your price:
51 135 (48 700 HUF + 5% VAT )
discount is: 20% (approx 12 784 HUF off)
Discount is valid until: 31 December 2024
The discount is only available for 'Alert of Favourite Topics' newsletter recipients.
Click here to subscribe.
Click here to subscribe.
Availability:
Not yet published.
Short description:
A comprehensive collection of major results and state-of-the-art research in approximation algorithms for the Traveling Salesman Problem.
Long description:
The Traveling Salesman Problem (TSP) is a central topic in discrete mathematics and theoretical computer science. It has been one of the driving forces in combinatorial optimization. The design and analysis of better and better approximation algorithms for the TSP has proved challenging but very fruitful. This is the first book on approximation algorithms for the TSP, featuring a comprehensive collection of all major results and an overview of the most intriguing open problems. Many of the presented results have been discovered only recently, and some are published here for the first time, including better approximation algorithms for the asymmetric TSP and its path version. This book constitutes and advances the state of the art and makes it accessible to a wider audience. Featuring detailed proofs, over 170 exercises, and 100 color figures, this book is an excellent resource for teaching, self-study, and further research.
'This is a fantastic book! Extensive coverage unifies the wide range of attacks on TSP complexity made over the past decade. A great read for experienced researchers and for those looking to join the field.' William Cook, University of Waterloo
'This is a fantastic book! Extensive coverage unifies the wide range of attacks on TSP complexity made over the past decade. A great read for experienced researchers and for those looking to join the field.' William Cook, University of Waterloo
Table of Contents:
Preface; 1. Introduction; 2. Linear programming relaxations of the Symmetric TSP; 3. Linear programming relaxations of the Asymmetric TSP; 4. Duality, cuts, and uncrossing; 5. Thin trees and random trees; 6. Asymmetric Graph TSP; 7. Constant-factor approximation for the Asymmetric TSP; 8. Algorithms for subtour cover; 9. Asymmetric Path TSP; 10. Parity correction of random trees; 11. Proving the main payment theorem for hierarchies; 12. Removable pairings; 13. Ear-Decompositions, matchings, and matroids; 14. Symmetric Path TSP and T-tours; 15. Best-of-Many Christofides and variants; 16. Path TSP by dynamic programming; 17. Further results, related problems; 18. State of the art, open problems; Bibliography; Index.