Visit our Christmas Gift Finder
Click & Collect from 2 Hours*
Last Christmas delivery dates
Free UK Standard Delivery On all orders £20 and over Order in time for Christmas 19th December 2nd Class | 20th December 1st Class Free Click & Collect to UK shops From 2 hours of your order*
The Design of Approximation Algorithms (Hardback)
  • The Design of Approximation Algorithms (Hardback)
zoom

The Design of Approximation Algorithms (Hardback)

(author), (author)
£51.99
Hardback 518 Pages / Published: 26/04/2011
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket
Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first section is devoted to a single algorithmic technique applied to several different problems, with more sophisticated treatment in the second section. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithm courses, it will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems.

Publisher: Cambridge University Press
ISBN: 9780521195270
Number of pages: 518
Weight: 1120 g
Dimensions: 262 x 189 x 34 mm


MEDIA REVIEWS
"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. Moehring, Technische Universitat 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
"This book is very well written. It could serve as a textbook on the design of approximation algorithms for discrete optimization problems. Readers will enjoy the clear and precise explanation of modern concepts, and the results obtained in this very elegant theory. Solving the exercises will benefit all readers interested in gaining a deeper understanding of the methods and results in the approximate algorithms for discrete optimization area." Alexander Kreinin, Computing Reviews
"Any researcher interested in approximation algorithms would benefit greatly from this new book by Williamson and Schmoys. It is an ideal starting point for the fresh graduate student, as well as an excellent reference for the experts in the field. The wrting style is very clear and lucid, and it was a pleasure reading and reviewing this book." Deeparnab Chakrabarty for SIGACT News
"The structure of the book is very interesting and allows a deeper understanding of the techniques presented. The whole book manages to develop a way of analyzing approximation algorithms and of designing approximation algorithms that perform well." Dana Simian, Mathematical Reviews

You may also be interested in...

The Mythical Man-Month
Added to basket
The Algorithm Design Manual
Added to basket
User Stories Applied
Added to basket
£40.49
Paperback
The Clean Coder
Added to basket
£33.49
Paperback
Explore It!
Added to basket
Essential Scrum
Added to basket
£36.99
Paperback
Impact Mapping
Added to basket
£9.99
Paperback
User Story Mapping
Added to basket
£31.99
Paperback
Pragmatic Guide to Git
Added to basket
Continuous Delivery
Added to basket
£44.49
Hardback
Making Embedded Systems
Added to basket
The Agile Samurai
Added to basket
The Software Craftsman
Added to basket
Domain-Driven Design
Added to basket
£55.49
Hardback

Please sign in to write a review

Your review has been submitted successfully.