Exponential Time Algorithms - Tapa blanda

Gaspers, Serge

 
9783639218251: Exponential Time Algorithms
Tapa blanda
ISBN 10: 3639218256 ISBN 13: 9783639218251
Editorial: VDM Verlag, 2010

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
VDM Verlag
Año de publicación
2010
Idioma
Inglés
ISBN 10 
3639218256
ISBN 13 
9783639218251
Encuadernación
Tapa blanda
Número de páginas
216
Contacto del fabricante
no disponible
Persona responsable
no disponible