Exact Exponential Algorithms

Buch | Hardcover
XIV, 206 Seiten
2010 | 2010
Springer Berlin (Verlag)
978-3-642-16532-0 (ISBN)
80,24 inkl. MwSt
For a long time computer scientists have distinguished between fast and slow algo rithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. All other algorithms are slow (or bad). The running time of slow algorithms is usually exponential. This book is about bad algorithms. There are several reasons why we are interested in exponential time algorithms. Most of us believe that there are many natural problems which cannot be solved by polynomial time algorithms. The most famous and oldest family of hard problems is the family of NP complete problems. Most likely there are no polynomial time al gorithms solving these hard problems and in the worst case scenario the exponential running time is unavoidable. Every combinatorial problem is solvable in ?nite time by enumerating all possi ble solutions, i. e. by brute force search. But is brute force search always unavoid able? De?nitely not. Already in the nineteen sixties and seventies it was known that some NP complete problems can be solved signi?cantly faster than by brute force search. Three classic examples are the following algorithms for the TRAVELLING SALESMAN problem, MAXIMUM INDEPENDENT SET, and COLORING.

The authors are highly regarded academics and educators in theoretical computer science, and in algorithmics in particular.

Branching.- Dynamic Programming.- Inclusion-Exclusion.- Treewidth.- Measure & Conquer.- Subset Convolution.- Local Search and SAT.- Split and List.- Time Versus Space.- Miscellaneous.- Conclusions, Open Problems and Further Directions.

Erscheint lt. Verlag 27.10.2010
Reihe/Serie Texts in Theoretical Computer Science. An EATCS Series
Zusatzinfo XIV, 206 p. 38 illus.
Verlagsort Berlin
Sprache englisch
Maße 155 x 235 mm
Gewicht 466 g
Themenwelt Mathematik / Informatik Informatik
Mathematik / Informatik Mathematik
Schlagworte Algorithm analysis and problem complexity • algorithms • Branching • combinatorics • Dynamic Programming • exact algorithms • Exponential algorithms • Graph • Hard optimization • Operations Research • Optimization • satisfiability • Vertex
ISBN-10 3-642-16532-X / 364216532X
ISBN-13 978-3-642-16532-0 / 9783642165320
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
leichter Einstieg für Senioren

von Philip Kiefer

Buch | Softcover (2024)
Markt + Technik Verlag
9,95