Approximation Algorithms
(Sprache: Englisch)
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...
Leider schon ausverkauft
versandkostenfrei
Buch (Gebunden)
Fr. 128.90
inkl. MwSt.
- Kreditkarte, Paypal, Rechnungskauf
- 30 Tage Widerrufsrecht
Produktdetails
Produktinformationen zu „Approximation Algorithms “
Klappentext zu „Approximation Algorithms “
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.
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. - László Lovász, Senior Researcher, Microsoft Research
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. - László Lovász, Senior Researcher, Microsoft Research
Inhaltsverzeichnis zu „Approximation Algorithms “
- IntroductionI. Combinatorial Algorithms:
- Set cover
- Steiner tree and TSP
- Multiway cuts and k-cuts
- k-center
- Feedback vertex set
- Shortest superstring
- Knapsack
- Bin packing
- Minimum makespan scheduling
- Euclidean TSP
II. LP-Based Algorithms:
- Introduction to LP-duality
- Rounding applied to set cover
- LP-duality based analysis for set cover
- The primal-dual schema
- Maximum satisfiability
- Scheduling on unrelated parallel machines
- Multicut and integer multicommodity flow in trees
- Multiway cut
- Multicut in general graphs
- Sparsest cut
- Steiner forest
- Steiner network
- Facility location
- k-median
- Semidefinite programming
III. Other Topics:
- Counting problems
- Shortest vector
- Hardness of approximation
- Open problems.
Bibliographische Angaben
- Autor: Vijay V. Vazirani
- 2002, 1. A., 2. korr. Nachdruck 2003, 380 Seiten, mit Abbildungen, Masse: 16,3 x 24,1 cm, Gebunden, Englisch
- Verlag: Springer
- ISBN-10: 3540653678
- ISBN-13: 9783540653677
- Erscheinungsdatum: 05.12.2002
Sprache:
Englisch
Rezension zu „Approximation Algorithms “
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
... mehr
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)
... weniger
Kommentar zu "Approximation Algorithms"
0 Gebrauchte Artikel zu „Approximation Algorithms“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Approximation Algorithms".
Kommentar verfassen