Exponential Time Algorithms (Paperback) (ISBN-13: 9783639218251)

This book studies exponential time algorithms for NP-hard problems. In this modern area, the aim is to design algorithms for combinatorially hard problems that execute provably faster than a brute-force enumeration of all candidate solutions. After an introduction and survey of the field, the text focuses first on the design and especially the analysis of branching algorithms. The analysis of these algorithms heavily relies on measures of the instances, which aim at capturing the structure of the instances, not merely their size. This makes them more appropriate to quantify the progress an algorithm makes in the process of solving a problem. Expanding the methodology to design exponential time algorithms, new techniques are then presented. Two of them combine treewidth based algorithms with branching or enumeration algorithms. Another one is the iterative compression technique, prominent in the design of parameterized algorithms, and adapted here to the design of exponential time algorithms. This book assumes basic knowledge of algorithms and should serve anyone interested in exactly solving hard problems.

Author: Serge Gaspers
ISBN-10: 3639218256
ISBN-13: 9783639218251
Publisher: VDM Verlag
Language: English
Published: 02/11/2010
Pages: 216
Format: Paperback
Weight: 0.71lbs
Size: 9.00h x 6.00w x 0.49d