Approximation Algorithms
(Sprache: Englisch)
Although this may seem a paradox, all exact science is dominated by the idea of approximation. Bertrand Russell (1872-1970) Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely...
lieferbar
versandkostenfrei
Buch (Kartoniert)
64.19 €
32 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „Approximation Algorithms “
Klappentext zu „Approximation Algorithms “
Although this may seem a paradox, all exact science is dominated by the idea of approximation. Bertrand Russell (1872-1970) Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed con jecture that P -=/= NP, their exact solution is prohibitively time consuming. Charting the landscape of approximability of these problems, via polynomial time algorithms, therefore becomes a compelling subject of scientific inquiry in computer science and mathematics. This book presents the theory of ap proximation algorithms as it stands today. It is reasonable to expect the picture to change with time. This book is divided into three parts. In Part I we cover combinato rial algorithms for a number of important problems, using a wide variety of algorithm design techniques. The latter may give Part I a non-cohesive appearance. However, this is to be expected - nature is very rich, and we cannot expect a few tricks to help solve the diverse collection of NP-hard problems. Indeed, in this part, we have purposely refrained from tightly cat egorizing algorithmic techniques so as not to trivialize matters. Instead, we have attempted to capture, as accurately as possible, the individual character of each problem, and point out connections between problems and algorithms for solving them.
Inhaltsverzeichnis zu „Approximation Algorithms “
1 Introduction.- I. Combinatorial Algorithms.- 2 Set Cover.- 3 Steiner Tree and TSP.- 4 Multiway Cut and k-Cut.- 5 k-Center.- 6 Feedback Vertex Set.- 7 Shortest Superstring.- 8 Knapsack.- 9 Bin Packing.- 10 Minimum Makespan Scheduling.- 11 Euclidean TSP.- II. LP-Based Algorithms.- 12 Introduction to LP-Duality.- 13 Set Cover via Dual Fitting.- 14 Rounding Applied to Set Cover.- 15 Set Cover via the Primal-Dual Schema.- 16 Maximum Satisfiability.- 17 Scheduling on Unrelated Parallel Machines.- 18 Multicut and Integer Multicommodity Flow in Trees.- 19 Multiway Cut.- 20 Multicut in General Graphs.- 21 Sparsest Cut.- 22 Steiner Forest.- 23 Steiner Network.- 24 Facility Location.- 25 k-Median.- 26 Semidefinite Programming.- III. Other Topics.- 27 Shortest Vector.- 28 Counting Problems.- 29 Hardness of Approximation.- 30 Open Problems.- A An Overview of Complexity Theory for the Algorithm Designer.- A.3.1 Approximation factor preserving reductions.- A.4 Randomized complexity classes.- A.5 Self-reducibility.- A.6 Notes.- B Basic Facts from Probability Theory.- B.1 Expectation and moments.- B.2 Deviations from the mean.- B.3 Basic distributions.- B.4 Notes.- References.- Problem Index.
Bibliographische Angaben
- Autor: Vijay V. Vazirani
- 2010, Softcover reprint of hardcover 1st ed. 2001, XIX, 380 Seiten, Maße: 15,7 x 23,6 cm, Kartoniert (TB), Englisch
- Verlag: Springer, Berlin
- ISBN-10: 3642084699
- ISBN-13: 9783642084690
Sprache:
Englisch
Pressezitat
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
... mehr
asection 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)
... 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