Dieter Kratsch: Exact Exponential Algorithms

Cover: 9783642265662 | Exact Exponential Algorithms | Dieter Kratsch (u. a.) | Taschenbuch

Dekorationsartikel gehören nicht zum Leistungsumfang.

Sprache: Englisch

49,90 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 4-7 Werktage

Kategorien:

Der Artikel ist nicht in deutscher Sprache verfasst.
Die Sprache der Produktbeschreibung und Details kann in Englisch angegeben sein. Sollten Sie Verständnisprobleme haben, wenden Sie sich gerne an uns.

Beschreibung

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.

Über den Autor

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

Zusammenfassung

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: [...]

Inhaltsverzeichnis

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.