株式会社極東書店トップ ＞ 商品一覧 ＞ Approximation Algorithms for Traveling Salesman Problems.
商品詳細
Approximation Algorithms for Traveling Salesman Problems.
・ISBN 978-1-009-44541-2 hard GB£ 125.00
￥39,600.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
電子版あり 大学・学術機関向け電子ブック（eBook）ISBN 978-1-009-44543-6
| 著者・編者 | Traub, Vera / Vygen, Jens, |
|---|---|
| 出版社 | (Cambridge University Press, UK) |
| 出版年月 | 2024 |
| ページ数 | 444 pp. |
| 言語 | ENG |
| ニュース番号 | ＜M25-5269＞ |
解説
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.