Approximation Algorithms

书名：Approximation Algorithms
作者：VijayV.Vazirani
译者：
ISBN：9783540653677
出版社：Springer
出版时间：2001-07-02
格式：epub/mobi/azw3/pdf
页数：399
豆瓣评分： 9.1

书籍简介：

'This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. It contains elegant combinatorial theory, useful and interesting algorithms, and deep results about the intrinsic complexity of combinatorial problems. Its clarity of exposition and excellent selection of exercises will make it accessible and appealing to all those with a taste for mathematics and algorithms' – Richard Karp, University Professor, University of California at Berkeley. Following the development of basic combinatorial optimization techniques in the 1960s and 1970s, a main open question was to develop a theory of approximation algorithms. In the 1990s, parallel developments in techniques for designing approximation algorithms as well as methods for proving hardness of approximation results have led to a beautiful theory. The need to solve truly large instances of computationally hard problems, such as those arising from the Internet or the human genome project, has also increased interest in this theory. The field is currently very active, with the toolbox of approximation algorithm design techniques getting always richer. It is a pleasure to recommend Vijay Vazirani's well-written and comprehensive book on this important and timely topic. "I am sure the reader will find it most useful both as an introduction to approximability as well as a reference to the many aspects of approximation algorithms' – Laszlo Lovasz, Senior Researcher, Microsoft Research.

作者简介：

书友短评：

@ xiaom 囫囵吞枣。。。 @ aaron 专业,经典 @ ×○×~~~ 全书两部分 每章基本针对一个问题 有例子 有算法 有分析 @ 残酷天使的命题 内容丰富，观点深刻，而且精炼，不可多得的好书 @ Takashi 初见科研~ @ 四代目 初见科研~ @ ×○×~~~ 全书两部分 每章基本针对一个问题 有例子 有算法 有分析 @ 残酷天使的命题 内容丰富，观点深刻，而且精炼，不可多得的好书 @ aaron 专业,经典

添加微信公众号:好书天下获取