
Exact Exponential Algorithms
Springer (Publisher)
Published in November 2010
Book
Hardback
XIII, 203 pages
978-3-642-16532-0 (ISBN)
Description
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.
More details
Product info
Book
Series
Edition
2010
Language
English
Place of publication
Heidelberg
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
38 s/w Abbildungen
38 Illustrations, black and white; XIV, 206 p. 38 illus.
Dimensions
Height: 241 mm
Width: 160 mm
Thickness: 17 mm
Weight
500 gr
ISBN-13
978-3-642-16532-0 (9783642165320)
DOI
10.1007/978-3-642-16533-7
Schweitzer Classification
Other editions
Additional editions

Fedor V. Fomin | Dieter Kratsch
Exact Exponential Algorithms
Book
12/2012
Springer
€53.49
Shipment within 7-9 days

Fedor V. Fomin | Dieter Kratsch
Exact Exponential Algorithms
E-Book
10/2010
1st Edition
Springer
€53.49
Available for download
Persons
The authors are highly regarded academics and educators in theoretical computer science, and in algorithmics in particular.
Content
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.