Exact Exponential Algorithms

Exact Exponential Algorithms
Author :
Publisher : Springer Science & Business Media
Total Pages : 208
Release :
ISBN-10 : 9783642165337
ISBN-13 : 3642165338
Rating : 4/5 (338 Downloads)

Book Synopsis Exact Exponential Algorithms by : Fedor V. Fomin

Download or read book Exact Exponential Algorithms written by Fedor V. Fomin and published by Springer Science & Business Media. This book was released on 2010-10-26 with total page 208 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.


Exact Exponential Algorithms Related Books

Exact Exponential Algorithms
Language: en
Pages: 208
Authors: Fedor V. Fomin
Categories: Mathematics
Type: BOOK - Published: 2010-10-26 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

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 ti
Graph-Theoretic Concepts in Computer Science
Language: en
Pages: 413
Authors: Juraj Hromkovič
Categories: Computers
Type: BOOK - Published: 2005-01-25 - Publisher: Springer

DOWNLOAD EBOOK

During its 30-year existence, the International Workshop on Graph-Theoretic Concepts in Computer Science has become a distinguished and high-quality computer sc
Parameterized Algorithms
Language: en
Pages: 618
Authors: Marek Cygan
Categories: Computers
Type: BOOK - Published: 2015-07-20 - Publisher: Springer

DOWNLOAD EBOOK

This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained g
Combinatorial Optimization -- Eureka, You Shrink!
Language: en
Pages: 219
Authors: Michael Jünger
Categories: Mathematics
Type: BOOK - Published: 2003-07-01 - Publisher: Springer

DOWNLOAD EBOOK

This book is dedicated to Jack Edmonds in appreciation of his ground breaking work that laid the foundations for a broad variety of subsequent results achieved
The Steiner Tree Problem
Language: en
Pages: 353
Authors: F.K. Hwang
Categories: Computers
Type: BOOK - Published: 1992-10-20 - Publisher: Elsevier

DOWNLOAD EBOOK

The Steiner problem asks for a shortest network which spans a given set of points. Minimum spanning networks have been well-studied when all connections are req