24小时热门版块排行榜    

CyRhmU.jpeg
查看: 6479  |  回复: 167
【奖励】 本帖被评价152次,作者pauldlx增加金币 118.6
当前只显示满足指定条件的回帖,点击这里查看本话题的所有回帖

pauldlx

木虫 (正式写手)


[资源] 【分享】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 数学基础 第一个记录
他山之石,可以攻玉

» 猜你喜欢

» 本主题相关价值贴推荐,对您同样有帮助:

已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖
引用回帖:
1楼: Originally posted by pauldlx at 2011-08-06 23:01:01:
详细介绍参见amazon:
http://www.amazon.com/Design-App ... amson/dp/0521195276

摘自亚马逊:
Editorial Reviews
Review
"This is a beautifully written ...

从出版信息看,全名应为“The design of approximation algorithms“,2010年出版。
4楼2011-08-07 08:56:01
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖
查看全部 168 个回答
简单回复
qqniu2楼
2011-08-06 23:46   回复  
五星好评  顶一下,感谢分享!
conanwj3楼
2011-08-07 08:50   回复  
三星好评  顶一下,感谢分享!
dannyxu5楼
2011-08-19 12:35   回复  
五星好评  顶一下,感谢分享!
lwc88776楼
2011-08-20 17:12   回复  
五星好评  顶一下,感谢分享!
2011-08-22 10:50   回复  
五星好评  顶一下,感谢分享!
kann8楼
2011-08-24 00:22   回复  
五星好评   顶一下,感谢分享!
2011-08-24 20:13   回复  
五星好评  顶一下,感谢分享!
gwyy10楼
2011-08-25 09:48   回复  
五星好评  顶一下,感谢分享!
djher11楼
2011-08-25 11:11   回复  
五星好评  顶一下,感谢分享!
polwork12楼
2011-08-27 14:44   回复  
五星好评  顶一下,感谢分享!
2011-09-02 16:42   回复  
三星好评  顶一下,感谢分享!
hjt_haust14楼
2011-09-02 22:27   回复  
五星好评  顶一下,感谢分享!
☆ 无星级 ★ 一星级 ★★★ 三星级 ★★★★★ 五星级
普通表情 高级回复(可上传附件)
信息提示
请填处理意见