سایت CEB:ترجمه تخصصی رشته کامپیوتر - معرفی و دانلود کتب انگلیسی رشته کامپیوتر

امتیاز کاربران

ستاره غیر فعالستاره غیر فعالستاره غیر فعالستاره غیر فعالستاره غیر فعال
 

انتشارات: Cambridge University Press

اثر: David P. Williamson and David B. Shmoys

تعداد صفحه: 496

حجم: 2.25MB

جلد کتاب

توضیحات کتاب (خلاصه پیشگفتار):

This book is designed to be a textbook for graduate-level courses in approximation algorithms. The courses were developed for students who have already had a class, undergraduate or graduate, in algorithms, and who were comfortable with the idea of mathematical proofs about the correctness of algorithms. The book also assumes some basic knowledge of probability theory (for instance, how to compute the expected value of a discrete random variable). Finally, we assume that the reader knows something about NP-completeness, at least enough to know that there might be good reason for wanting fast, approximate solutions to NP-hard discrete optimization problems. At one or two points in the book, we do an NP-completeness reduction to show that it can be hard to find approximate solutions to such problems; we include a short appendix on the problem class NP and the notion of NP-completeness for those unfamiliar with the concepts. In addition to serving as a graduate textbook, we have also envisioned the book as a way for students to get the background to read current research in the area of approximation algorithms. In particular, we wanted a book that we could hand our own Ph.D. students just starting in the field, and say “Here, read this.”

We further hope that the book will serve as a reference to the area of approximation algorithms for researchers who are generally interested in the heuristic solution of discrete optimization problems; such problems appear in areas as diverse as traditional operations research planning problems (such as facility location and network design) to computer science problems in database and programming language design to advertising issues in viral marketing.

We have taken several particular perspectives in writing the book. The first is that we wanted to organize the material around certain principles of designing approximation algorithms, around algorithmic ideas that have been used in different ways and applied to different optimization problems. The book is structured around these design techniques. The introduction applies several of them to a single problem, the set cover problem. The book then splits into two parts. In the first part, each chapter is devoted to a single algorithmic idea (e.g., “greedy and local search algorithms”, “rounding data and dynamic programming”), and the idea is then applied to several different problems. The second part revisits all of the same algorithmic ideas, but gives more sophisticated treatments of them; the results covered here are usually much more recent. The layout allows us to look at several central optimization problems repeatedly throughout the book, returning to them as a new algorithmic idea leads to a better result than the previous one. In particular, we revisit such problems as the uncapacitated facility location problem, the prize-collecting Steiner tree problem, the bin-packing problem, and the maximum cut problem several times throughout the course of the book.

The second perspective is that we treat linear and integer programming as a central aspect in the design of approximation algorithms. This perspective is from our background in the operations research and mathematical programming communities. The third perspective we took in writing the book is that we have limited ourselves to results that are simple enough for classroom presentation while remaining central to the topic at hand.

آیکن نشانگر نوع فایل در سایت CEBدانلود


برای دانلود کتاب، ثبت درخواست ترجمه، و دریافت رایگان خبرنامه‌های سایت نیاز به ثبت نام دارید.

آیا از خواندن متون ترجمه‌ای بی سر و ته خسته شده‌اید؟ و بدنبال راهی برای بهره‌گیری از یک متن اصیل برای یادگیری هستید؟
آیا وقت کافی برای فهم و یا ترجمه‌ی مطلب خود در اختیار ندارید؟
از خواندن متنی که کارتان گیر آن است کلافه شده‌اید؟
کار را به ما بسپارید، خیالتان راحت!

هم اکنون! سايت CEB را به چند نفر از دوستان خود هم معرفی کنيد؛ با اين کار علاوه بر حمايت از ما، به بالا رفتن کيفيت خدمات و پايين ماندن تعرفه‌ی دانلود هم کمک کرده‌ايد.



dear author and publishers!
If you do not agree that your books be freely available through this site to Iranians - Those who are not subject to the Copy Right law - please contact us through your official email address so that we can identify you as the author or publisher of that books and remove all the books that you don't like to be accessible through this site. Note that only downloadable material can appear on this website. Also, note that this site is not the source of illegal publication of the books; We only gathered the books accessible via the Internet together and made these books more accessible to Iranians.


Valid XHTML 1.0 Transitional