Combinatorial Optimization: Theory and Algorithms 6th
暫譯: 組合最佳化:理論與演算法 第六版
Bernhard Korte, Jens Vygen
- 出版商: Springer
- 出版日期: 2018-03-23
- 售價: $3,980
- 貴賓價: 9.5 折 $3,781
- 語言: 英文
- 頁數: 698
- 裝訂: Hardcover
- ISBN: 3662560380
- ISBN-13: 9783662560389
-
相關分類:
Algorithms-data-structures
立即出貨 (庫存=1)
買這商品的人也買了...
商品描述
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 to represent the state of the art of combinatorial optimization.
商品描述(中文翻譯)
這本關於組合優化的綜合教科書特別強調理論結果和具有可證明良好性能的演算法,與啟發式方法形成對比。它基於多門關於組合優化和專門主題的課程,主要針對研究生層級。本書回顧了基本概念,詳細涵蓋了經典主題(路徑、流、匹配、母體、NP 完全性、近似演算法),並進一步探討了高級和最新主題,其中一些在教科書中尚未出現。全書包含完整但簡潔的證明,並提供了大量的練習題和參考文獻。
這第六版再次進行了更新、修訂和顯著擴展。除了其他新增內容外,還包括淺光樹(shallow-light trees)、子模函數最大化(submodular function maximization)、背包問題的平滑分析(smoothed analysis of the knapsack problem)、(ln 4+ɛ)-近似的斯坦納樹(Steiner trees)以及 VPN 定理(VPN theorem)等新章節。因此,本書繼續代表組合優化的最新技術水平。