| 书目名称 | Combinatorial Optimization | | 副标题 | Theory and Algorithm | | 编辑 | Bernhard Korte,Jens Vygen | | 视频video | | | 概述 | Well-written, popular textbook on combinatorial optimization.One of very few textbooks on this topic.Subject area has manifold applications.Offers complete but concise proofs, making it an invaluable | | 丛书名称 | Algorithms and Combinatorics | | 图书封面 |  | | 描述 | .This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. .This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley‘s formula, blocking flows, faster .b.-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.. | | 出版日期 | Textbook 20125th edition | | 关键词 | combinatorial optimization; discrete algorithms; mathematical programming; combinatorics | | 版次 | 5 | | doi | https://doi.org/10.1007/978-3-642-24488-9 | | isbn_ebook | 978-3-642-24488-9Series ISSN 0937-5511 Series E-ISSN 2197-6783 | | issn_series | 0937-5511 | | copyright | Springer-Verlag Berlin Heidelberg 2012 |
The information of publication is updating
|
|
发表于 2025-3-21 18:38:14
