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完全性、近似演算法),並進一步探討了一些先進和最新的主題,其中一些在教科書中尚未出現。全書提供完整但簡潔的證明,並提供大量練習和參考資料。

這本第六版再次進行了更新、修訂和顯著擴充。新增的內容包括淺輕樹、次模函數最大化、背包問題的平滑分析、Steiner樹的(ln 4+ɛ)-近似和VPN定理等新節。因此,這本書繼續代表組合優化的最新技術水平。