Approximation AlgorithmsSpringer Science & Business Media, 14.03.2013 - 380 Seiten 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. |
Inhalt
1 | |
Part I Combinatorial Algorithms | 12 |
Part II LPBased Algorithms | 90 |
Part III Other Topics | 270 |
A An Overview of Complexity Theory for the Algorithm Designer | 344 |
B Basic Facts from Probability Theory | 353 |
356 | |
373 | |
377 | |
Andere Ausgaben - Alle anzeigen
Häufige Begriffe und Wortgruppen
achieves approximation algorithm assume basis bits called capacity Chapter Cited clauses Clearly components compute connected Consider constant constraints construct contains corresponding cost cycle defined denote directed distance dual edge elements endpoints established example Exercise expectation facility fact factor feasible solution flow fractional function Give given graph graph G guarantee hardness Hence independent inequality instance integral iteration least Lemma length linear lower bound matching MAX-3SAT maximize maximum metric minimize minimum multicut NP-hard O(log objective Observe obtain optimal solution output packing pair path picked polynomial positive primal probability problem Proof prove random reduction relaxation removal result running satisfies semidefinite programming set cover shortest Show simple solution specified string Suppose Theorem tight variables vector vertex vertex cover vertices weight