Approximation Algorithms (Paperback)
  • Approximation Algorithms (Paperback)

Approximation Algorithms (Paperback)

Paperback 380 Pages / Published: 08/12/2010
  • We can order this from the publisher

Usually dispatched within 10-15 working days

  • This item has been added to your basket
Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field. He gives clear, lucid explanations of key results and ideas, with intuitive proofs, and provides critical examples and numerous illustrations to help elucidate the algorithms. Many of the results presented have been simplified and new insights provided. Of interest to theoretical computer scientists, operations researchers, and discrete mathematicians.

Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN: 9783642084690
Number of pages: 380
Weight: 617 g
Dimensions: 235 x 155 x 20 mm
Edition: Softcover reprint of hardcover 1st ed. 2001


From the reviews:

"Approximation algorithms is an area where much progress has been made in the last 10 years. The book under review is a very good help for understanding these results. In each of the 27 chapters an important combinatorial optimization problem is presented and one or more approximation algorithms for it are clearly and concisely described and analyzed. In this way most of the most important results from the approximation algorithm literature are covered, often more easily comprehensible than the original articles." (Viggo Kann, Zentralblatt MATH, Vol. 1005, 2003)

"The book under review concentrates on the ... design and analysis of efficient approximation algorithms with good performance guarantees. It is possibly the first textbook to provide an extensive and systematic coverage of this topic. ... The book starts briskly, using simple examples to illustrate some of the key concepts and draw the reader rapidly in. ... Copious exercises are included to test and deepen the reader's understanding. ... It deserves a place in every computer science and mathematical library." (Mark R. Jerrum, Mathematical Reviews, 2002 h)

"The book of Vijay Vazirani is not the first one dedicated to approximation algorithms ... . However it is, I believe, among the very best from a didactical point of view: this is the text I would chose, would I have to give a course on approximation algorithms ... . I suspect that for many researchers it would be the first one to consult ... . It is a must acquisition for libraries of computer science/engineering departments ... ." (Francesco Maffioli, Mathematical Methods of Operations Research, Vol. 56 (2), 2002)

"The book gives an overview on the theory of approximation algorithms. It presents the most important problems, the basic methods and ideas which are used in this area. ... The book can be used for a graduate course on approximation algorithms. ... The chapters also contain a section of exercises, which can help the students to understand the material in a deeper way. ... On the other hand the book can be used by the researchers of the field ... ." (Csanad Imreh, Acta Scientiarum Mathematicarum, Vol. 68, 2002)

You may also be interested in...

Mythical Man-Month, The
Added to basket
Discrete Mathematics
Added to basket
The Elements of Statistical Learning
Added to basket
Portfolio, Programme and Project Offices (P3O)
Added to basket
Rocket Surgery Made Easy
Added to basket
Using Docker
Added to basket
The Annotated Turing
Added to basket
Computing with Quantum Cats
Added to basket
Don't Make Me Think, Revisited
Added to basket
Introducing Artificial Intelligence
Added to basket
Game Art
Added to basket
Alan Turing: The Enigma Man
Added to basket
The Quest for Artificial Intelligence
Added to basket
AQA A level Computer Science
Added to basket

Please sign in to write a review

Your review has been submitted successfully.