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

» 猜你喜欢

• 一志愿中科大材料与化工，353分还有调剂学校吗 已经有13人回复
• 085600材料与化工调剂 已经有6人回复
• 320求调剂 已经有6人回复
• 期刊推荐 已经有5人回复
• 有没有接收比较快的sci期刊呀，最好在一个月之内的，研三孩子求毕业 已经有7人回复
• 又一批高校组建人工智能学院 师资行吗 不是骗人吗 已经有4人回复
• 297，工科调剂?河南农业大学本科 已经有15人回复
• 337求调剂 已经有3人回复
• 申博/考博 已经有5人回复
• 申博 已经有3人回复

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

• 【分享】《The Practice of Programming》(应该是编程必备吧，程序设计实践) 已经有147人回复
• I have calculated the density of ether 已经有3人回复
• What were the dates of your previous affiliation？什么意思 已经有3人回复
• a hard copy of the manuscript 是什么呀 已经有7人回复
• 【求助】the French Ministry of Education and Research 已经有14人回复
• 【其他】征集第一性原理计算方面牛人的主页【活动结束】 已经有80人回复
• 重奖征集国内国外做理论计算课题组的信息 已经有44人回复
• 【资源】Biomembrane Frontiers: Nanostructures, Models, and the Design of Life 已经有8人回复