The Design of Approximation Algorithms

0
(0)

The Design of Approximation Algorithms

作者:DavidP.Williamson/DavidB.Shmoys

出版社:CambridgeUniversityPress

出版年:2011-4-26

页数:518

定价:GBP51.99

装帧:Hardcover

ISBN:9780521195270

内容简介
······

Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first section is devoted to a single algorithmic technique applied to several different problems, with more sophisticated treatment in the second section. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithm courses, it will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems.

评论 ······

个人觉得比Vijay的写得好。

案头手册书,基本上所有常用的的近似算法技术都有涉及,而且包含了很多经典结果的简化。闲着没事的时候读读总有新收获。

还是比较全的 可以再加一些property testing的模型 比如 monotonicity, regularity lemma, triangle freeness 之类的

题材组织的还不错,不过例题的讲解没有vazirani那本清楚

点击星号评分!

平均分 0 / 5. 投票数: 0

还没有投票!请为他投一票。

评论 抢沙发

评论前必须登录!

 

登录

找回密码

注册