Combinatorial Optimization:Theory and Algorithms(Algorithms and Combinatorics)

组合优化:理论与算法 第6版

数学史

原   价:
904.00
售   价:
678.00
发货周期:预计8-10周发货
作      者
出  版 社
出版时间
2018年03月23日
装      帧
精装
ISBN
9783662560389
复制
页      码
698
语      种
英文
版      次
6th Ed.
综合评分
暂无评分
我 要 买
- +
库存40本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
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.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个