Combinatorial optimization theory and algorithms / [electronic resource] :
- 作者： Korte, Bernhard.
- 其他作者：
- 其他題名：
- Algorithms and combinatorics
- 出版： Berlin, Heidelberg : Springer Berlin Heidelberg
- 版本：5th ed.
- 叢書名： Algorithms and combinatoricsv.21
- 主題： Combinatorial optimization , Mathematics , Combinatorics. , Calculus of Variations and Optimal Control; Optimization. , Mathematics of Computing. , Operations Research/Decision Theory.
- ISBN： 9783642244889 (electronic bk.) 、 9783642244872 (paper)
-
FIND@SFXID:
CGU
- 資料類型: 電子書
-
讀者標籤：
- 系統號： 005082976 | 機讀編目格式
館藏資訊
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.