| 查看: 7575 | 回复: 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 ] |
回复此楼» 猜你喜欢
考博求助
已经有3人回复
-
售SCI一区文章，我:8.O.551.O.5.4,科目全,可伽急
已经有5人回复
-
售SCI一区T0P文章，我:8.O.55.1.O.5.4,科目全,可+急
已经有4人回复
-
售SCI一区T0P文章，我:8.O.55.1.O.5.4,科目全,可+急
已经有5人回复
-
售SCI-T0P文章，我:8O.5.5.1.O.54,科目齐全,可+急
已经有9人回复
-
售一区SCI文章T0P，我:8O.551.O54,科目全,可十急
已经有9人回复
-
售SCI一区T0P文章，我:8.O.55.1.O.5.4,科目全,可+急
已经有10人回复
-
售SCI一区文章，我:8.O.551.O.5.4,科目全,可伽急
已经有6人回复
-
售SCI一区T0P文章，我:8O.55.1.O.54,科目全,可伽急
已经有9人回复
-
售SCI一区T0P文章，我:8O.55.1.O.54,科目全,可伽急
已经有7人回复
66楼2012-01-08 10:36:20
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
回复
五星好评 顶一下，感谢分享！
