{"product_id":"approximation-algorithms-for-traveling-salesman-problems-hardback-9781009445412","title":"Approximation Algorithms for Traveling Salesman Problems (Hardback) 9781009445412","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eApproximation Algorithms for Traveling Salesman Problems\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cem\u003eA comprehensive collection of major results and state-of-the-art research in approximation algorithms for the Traveling Salesman Problem.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eVera Traub (Author), Jens Vygen (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9781009445412, Cambridge University Press\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 5 December 2024\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e444 pages\u003cbr\u003e23.5 x 15.9 x 2.9 cm, 0.76 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cem\u003e\u003cfont size=\"3\"\u003e'This is an amazing book by world-leading experts Vera Traub and Jens Vygen. It comprehensively covers and simplifies recent developments on approximation algorithms for the traveling salesman problem. The clarity and extensive treatment of advanced algorithmic techniques make this book a must-read for anyone interested in advanced algorithmic techniques and approximation algorithms.' Ola Svensson, École Polytechnique Fédérale de Lausanne\u003c\/font\u003e\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eThe 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.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003ePreface\u003cbr\u003e 1. Introduction\u003cbr\u003e 2. Linear programming relaxations of the Symmetric TSP\u003cbr\u003e 3. Linear programming relaxations of the Asymmetric TSP\u003cbr\u003e 4. Duality, cuts, and uncrossing\u003cbr\u003e 5. Thin trees and random trees\u003cbr\u003e 6. Asymmetric Graph TSP\u003cbr\u003e 7. Constant-factor approximation for the Asymmetric TSP\u003cbr\u003e 8. Algorithms for subtour cover\u003cbr\u003e 9. Asymmetric Path TSP\u003cbr\u003e 10. Parity correction of random trees\u003cbr\u003e 11. Proving the main payment theorem for hierarchies\u003cbr\u003e 12. Removable pairings\u003cbr\u003e 13. Ear-Decompositions, matchings, and matroids\u003cbr\u003e 14. Symmetric Path TSP and T-tours\u003cbr\u003e 15. Best-of-Many Christofides and variants\u003cbr\u003e 16. Path TSP by dynamic programming\u003cbr\u003e 17. Further results, related problems\u003cbr\u003e 18. State of the art, open problems\u003cbr\u003e Bibliography\u003cbr\u003e Index.\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Optimization [\u003ca title=\"See our other books on Optimization\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Optimization%20%5BPBU%5D%22\"\u003ePBU\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Cambridge University Press","offers":[{"title":"Brand New","offer_id":52414013571352,"sku":"9781009445412","price":99.98,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/files\/9781009445412i.jpg?v=1784335851","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/approximation-algorithms-for-traveling-salesman-problems-hardback-9781009445412","provider":"Freshly Printed Books","version":"1.0","type":"link"}