Exponential Time Algorithms: Structures, Measures, and Bounds - Serge Gaspers - Bøger - VDM Verlag Dr. Müller - 9783639218251 - 11. februar 2010
Ved uoverensstemmelse mellem cover og titel gælder titel

Exponential Time Algorithms: Structures, Measures, and Bounds

Serge Gaspers

Pris
zł 392,90

Bestilles fra fjernlager

Forventes klar til forsendelse 24. - 31. jul.
Tilføj til din iMusic ønskeseddel
Eller

Exponential Time Algorithms: Structures, Measures, and Bounds

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.

Medie Bøger     Paperback Bog   (Bog med blødt omslag og limet ryg)
Udgivet 11. februar 2010
ISBN13 9783639218251
Forlag VDM Verlag Dr. Müller
Antal sider 216
Mål 322 g
Sprog Engelsk