24小时热门版块排行榜

返回列表

【奖励】本帖被评价152次，作者pauldlx增加金币 118.6 个

当前只显示满足指定条件的回帖，点击这里查看本话题的所有回帖

pauldlx

木虫 (正式写手)

信息EPI: 1
应助: 3 (幼儿园)
金币: 1965.4
帖子: 306
在线: 62.2小时
虫号: 1336651

[资源] 【分享】The Design of Approximation Algorithms （剑桥2011年出版）【已搜无重复】

详细介绍参见amazon:
http://www.amazon.com/Design-App ... amson/dp/0521195276

摘自亚马逊：
Editorial Reviews
Review
"This is a beautifully written book that will bring anyone who reads it to the current frontiers of research in approximation algorithms. It covers everything from the classics to the latest, most exciting results such as ARV's sparsest cut algorithm, and does so in an extraordinarily clear, rigorous and intuitive manner."
Anna Karlin, University of Washington

"The authors of this book are leading experts in the area of approximation algorithms. They do a wonderful job in providing clear and unified explanations of subjects ranging from basic and fundamental algorithmic design techniques to advanced results in the forefront of current research. This book will be very valuable to students and researchers alike."
Uriel Feige, Professor of Computer Science and Applied Mathematics, the Weizmann Institute

"Theory of approximation algorithms is one of the most exciting areas in theoretical computer science and operations research. This book, written by two leading researchers, systematically covers all the important ideas needed to design effective approximation algorithms. The description is lucid, extensive and up-to-date. This will become a standard textbook in this area for graduate students and researchers."
Toshihide Ibaraki, The Kyoto College of Graduate Studies for Informatics

"This book on approximation algorithms is a beautiful example of an ideal textbook. It gives a concise treatment of the major techniques, results and references in approximation algorithms and provides an extensive and systematic coverage of this topic up to the frontier of current research. It will become a standard textbook and reference for graduate students, teachers and researchers in the field."
Rolf H. Möhring, Technische Universität Berlin

"I have fond memories of learning approximation algorithms from an embryonic version of this book. The reader can expect a clearly written and thorough tour of all the important paradigms for designing efficient heuristics with provable performance guarantees for combinatorial optimization problems."
Tim Roughgarden, Stanford University

Product Details
Hardcover: 520 pages
Publisher: Cambridge University Press; 1 edition (April 26, 2011)
Language: English
ISBN-10: 0521195276
ISBN-13: 978-0521195270

[ Last edited by pauldlx on 2011-8-7 at 15:00 ]

回复此楼

» 收录本帖的淘帖专辑推荐

国外专业电子书1	计算机视觉	控制理论与工程	科研与育人
Algorithm	撰写论文必看	信息技术	各类相关书籍
我还是喜欢	文档	我喜欢	信息类电子教材
计算机专业书籍	Programming	数学基础	第一个记录
他山之石，可以攻玉