| 查看: 6484 | 回复: 167 | ||
| 当前只显示满足指定条件的回帖，点击这里查看本话题的所有回帖 | ||
[资源]
【分享】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 ] |
回复此楼» 猜你喜欢
请问哪里可以有青B申请的本子可以借鉴一下。
已经有4人回复
-
真诚求助：手里的省社科项目结项要求主持人一篇中文核心，有什么渠道能发核心吗
已经有6人回复
-
孩子确诊有中度注意力缺陷
已经有14人回复
-
三甲基碘化亚砜的氧化反应
已经有4人回复
-
请问下大家为什么这个铃木偶联几乎不反应呢
已经有5人回复
-
请问有评职称，把科研教学业绩算分排序的高校吗
已经有5人回复
-
2025冷门绝学什么时候出结果
已经有3人回复
-
天津工业大学郑柳春团队欢迎化学化工、高分子化学或有机合成方向的博士生和硕士生加入
已经有4人回复
-
康复大学泰山学者周祺惠团队招收博士研究生
已经有6人回复
-
AI论文写作工具：是科研加速器还是学术作弊器？
已经有3人回复
103楼2012-11-18 18:51:09
4楼2011-08-07 08:56:01
简单回复
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
回复
五星好评 顶一下，感谢分享！
warwicktiger13楼
2011-09-02 16:42
回复
三星好评 顶一下，感谢分享！
hjt_haust14楼
2011-09-02 22:27
回复
五星好评 顶一下，感谢分享！