Overview
- Textbook has been class-tested by the authors and their collaborators
- Text is supported throughout with exercises and notes for further reading
- Comprehensive introduction for researchers
- Includes supplementary material: sn.pub/extras
Part of the book series: Texts in Theoretical Computer Science. An EATCS Series (TTCS)
Buy print copy
About this book
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.
Similar content being viewed by others
Keywords
Table of contents (12 chapters)
-
Front Matter
-
Back Matter
Authors and Affiliations
About the authors
The authors are highly regarded academics and educators in theoretical computer science, and in algorithmics in particular.
Bibliographic Information
Book Title: Exact Exponential Algorithms
Authors: Fedor V. Fomin, Dieter Kratsch
Series Title: Texts in Theoretical Computer Science. An EATCS Series
DOI: https://doi.org/10.1007/978-3-642-16533-7
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2010
Hardcover ISBN: 978-3-642-16532-0Published: 27 October 2010
Softcover ISBN: 978-3-642-26566-2Published: 01 December 2012
eBook ISBN: 978-3-642-16533-7Published: 26 October 2010
Series ISSN: 1862-4499
Series E-ISSN: 1862-4502
Edition Number: 1
Number of Pages: XIV, 206
Number of Illustrations: 38 b/w illustrations
Topics: Discrete Mathematics, Optimization, Programming Techniques, Algorithm Analysis and Problem Complexity, Combinatorics