| 書(shū)目名稱 | Combinatorial Optimization | | 副標(biāo)題 | Theory and Algorithm | | 編輯 | Bernhard Korte,Jens Vygen | | 視頻video | http://file.papertrans.cn/230/229960/229960.mp4 | | 概述 | 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 | | 叢書(shū)名稱 | Algorithms and Combinatorics | | 圖書(shū)封面 |  | | 描述 | .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 sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+?)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues torepresent the state of the art of combinatorial optimization.. | | 出版日期 | Textbook 2018Latest edition | | 關(guān)鍵詞 | combinatorial optimization; discrete algorithms; mathematical programming; graphs; integer linear progra | | 版次 | 6 | | doi | https://doi.org/10.1007/978-3-662-56039-6 | | isbn_softcover | 978-3-662-58566-5 | | isbn_ebook | 978-3-662-56039-6Series ISSN 0937-5511 Series E-ISSN 2197-6783 | | issn_series | 0937-5511 | | copyright | Springer-Verlag GmbH Germany, part of Springer Nature 2018 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2026-1-29 19:27
發(fā)表于 2025-3-21 16:10:35
