Dieter Kratsch's Books

Exact Exponential Algorithms

By: Fedor V. Fomin,Dieter Kratsch

Write a review Read reviews Take a Quiz Solve Book Puzzle

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.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

208

Publisher

Springer Science & Business Media

Published Date

ISBN 10

3642165338

ISBN 13

9783642165337

Exact Exponential Algorithms

By: Fedor V. Fomin,Dieter Kratsch

Write a review Read reviews Take a Quiz Solve Book Puzzle

Exact Exponential Algorithms

By: Fedor V. Fomin,Dieter Kratsch

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

208

Publisher

Springer Science & Business Media

Published Date

ISBN 10

3642165338

ISBN 13

9783642165337

Graph-Theoretic Concepts in Computer Science

33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007, Revised Papers

By: Andreas Brandstädt

Write a review Read reviews Take a Quiz Solve Book Puzzle

Graph-Theoretic Concepts in Computer Science

33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007, Revised Papers

By: Andreas Brandstädt

This book constitutes the thoroughly refereed post-proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2007, held in Dornburg, Germany, in June 2007. The 30 revised full papers presented together with one invited paper were carefully selected from 99 submissions. The papers feature original results on all aspects of graph-theoretic concepts in Computer Science, including structural graph theory, graph-based modeling, and graph-drawing.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

351

Publisher

Springer Science & Business Media

Published Date

ISBN 10

3540748385

ISBN 13

9783540748380

Book's by Dieter Kratsch

Exact Exponential Algorithms

Exact Exponential Algorithms

Exact Exponential Algorithms

Exact Exponential Algorithms

Graph-Theoretic Concepts in Computer Science

Graph-Theoretic Concepts in Computer Science

Username

Password

Username

Password

Password again

Birthday

Email