Approximation Algorithms for Traveling Salesman Problems - Hardcover

Vera Traub , Jens Vygen

Hardcover

ISBN 10: 1009445413 ISBN 13: 9781009445412

Publisher: Cambridge University Press, 2024

Synopsis

A comprehensive collection of major results and state-of-the-art research in approximation algorithms for the Traveling Salesman Problem.

About this title

About the Author

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.

Edition details

• Publisher: Cambridge University Press
• Publication date: 2024
• Language: English
• ISBN 10: 1009445413
• ISBN 13: 9781009445412
• Binding: Hardcover
• Number of pages: 439