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

‘The wonderful new textbook by Traub and Vygen is a pleasure to read - there have been very successful textbooks on the TSP, and on approximation algorithms, but this is the first to focus on approximation algorithms for the TSP. At first, this might seem like a too repetitive diet, but the richness of the developments of the past decade or so, all elegantly presented here to the last detail, demonstrates the wealth of variety of algorithmic thinking that has produced these advances.’

David B. Shmoys - Cornell University

‘Thoroughly Simplified Presentation of the latest approximation results on key variants of the TSP. A gem and a must-read for both novice and experts in the area! Like the 4 C's of a diamond: Clear, Comprehensive, Careful and Captivating.’

Michel Goemans - Massachusetts Institute of Technology

‘This book is a very welcome addition to the literature on the fascinating and addicting traveling salesman problem. It gives a consistent and unified treatment of approximation algorithms, starting with a very thorough treatment of the basics and extending through the most recent developments, including work by these two authors. This volume will be valued by researchers and graduate instructors alike.’

David P. Williamson - Cornell University