- Gebundene Ausgabe: 380 Seiten
- Verlag: Springer; Auflage: 1st ed. 2001. Corr. 2nd printing 2002 (5. Dezember 2002)
- Sprache: Englisch
- ISBN-10: 3540653678
- ISBN-13: 978-3540653677
- Größe und/oder Gewicht: 23,4 x 2,4 x 15,6 cm
- Durchschnittliche Kundenbewertung: 1 Kundenrezension
- Amazon Bestseller-Rang: Nr. 218.497 in Fremdsprachige Bücher (Siehe Top 100 in Fremdsprachige Bücher)
- Komplettes Inhaltsverzeichnis ansehen
Andere Verkäufer auf Amazon
+ kostenlose Lieferung
+ kostenlose Lieferung
Approximation Algorithms (Englisch) Gebundene Ausgabe – 5. Dezember 2002
Wird oft zusammen gekauft
Kunden, die diesen Artikel gekauft haben, kauften auch
Es wird kein Kindle Gerät benötigt. Laden Sie eine der kostenlosen Kindle Apps herunter und beginnen Sie, Kindle-Bücher auf Ihrem Smartphone, Tablet und Computer zu lesen.
Geben Sie Ihre Mobiltelefonnummer ein, um die kostenfreie App zu beziehen.
Wenn Sie dieses Produkt verkaufen, möchten Sie über Seller Support Updates vorschlagen?
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 … ." (Csanád Imreh, Acta Scientiarum Mathematicarum, Vol. 68, 2002)
"This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. It contains elegant combinatorial theory, useful and interesting algorithms, and deep results about the intrinsic complexity of combinatorial problems. Its clarity of exposition and excellent selection of exercises will make it accessible and appealing to all those with a taste for mathematics and algorithms." - Richard Karp, University Professor, University of California at Berkeley. Following the development of basic combinatorial optimization techniques in the 1960s and 1970s, a main open question was to develop a theory of approximation algorithms. In the 1990s, parallel developments in techniques for designing approximation algorithms as well as methods for proving hardness of approximation results have led to a beautiful theory. The need to solve truly large instances of computationally hard problems, such as those arising from the Internet or the human genome project, has also increased interest in this theory. The field is currently very active, with the toolbox of approximation algorithm design techniques getting always richer.It is a pleasure to recommend Vijay Vazirani's well-written and comprehensive book on this important and timely topic. "I am sure the reader will find it most useful both as an introduction to approximability as well as a reference to the many aspects of approximation algorithms." - Laszlo Lovasz, Senior Researcher, Microsoft Research. Alle Produktbeschreibungen
Kunden, die diesen Artikel angesehen haben, haben auch angesehen
Derzeit tritt ein Problem beim Filtern der Rezensionen auf. Bitte versuchen Sie es später noch einmal.
Die hilfreichsten Kundenrezensionen auf Amazon.com
The first part of the book presents a set of classical NP hard problems, set covering, bin packing, knapsack, etc. and their approximation algorithms. These algorithms are extracted from a number of fundamental papers, which are of long, delicate presentations. Vazirami presented the problems and solutions in a unified framework. The presentation appears much shorter than they were in the original papers, and they are concise, precise, explicit and comprehensive. For an algorithm researcher, if he read the book first and then those papers, he will be much more efficient than doing that other way (as I and many other people did.)
The second part of the book present the LP scheme of approximation algorithm design. I had little knowledge about this. But to pursue a career as an algorithm researcher, I must know this. Vazirani's book gives me a comprehensive (yet short) start.
I rarely give my reviews five stars (2% of my reviews get 5 stars so far), but this book deserves.
For a beginner, one would expect a book that starts from ground-up and that has been written as a textbook rather than as a set of research papers. The book by Dr. Vazirani, is the only book that is written by one author with a step-by-step evolution of concepts and ideas related to approximation algorithms.