Approximation Algorithms for Traveling Salesman Problems Traub Vygen Hardback

Approximation Algorithms for Traveling Salesman Problems\nby Jens Vygen\nHardback\nEnglish\n\nDelivery\nUsually delivered in 2\u20133 working days (dispatched today if ordered before 3pm).\n\nBrand new copy from BookCurl \u2013 the UK independent online bookseller.\n\n------------------------------\nBook details\n------------------------------\nAuthor: Jens Vygen\nTitle: Approximation Algorithms for Traveling Salesman Problems\nFormat: Hardback\nLanguage: English\nPublisher: Cambridge University Press\nPublication year: 2024\nISBN-13: 9781009445412\nISBN-10: 1009445413\n\n------------------------------\nDescription\n------------------------------\nThe 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 approxi.