Invitation to Fixed Parameter Algorithms - Couverture rigide

Livre 9 sur 16: Oxford Lecture Series in Mathematics and Its Applications

Niedermeier, Rolf

 
9780198566076: Invitation to Fixed Parameter Algorithms
Couverture rigide
ISBN 10 : 0198566077 ISBN 13 : 9780198566076
Editeur : Oxford University Press, 2006

Synopsis

This research-level text is an application-oriented introduction to the growing and highly topical area of the development and analysis of efficient fixed-parameter algorithms for optimally solving computationally hard combinatorial problems.

The book is divided into three parts: a broad introduction that provides the general philosophy and motivation; followed by coverage of algorithmic methods developed over the years in fixed-parameter algorithmics forming the core of the book; and a discussion of the essentials from parameterized hardness theory with a focus on W[1]-hardness which parallels NP-hardness, then stating some relations to polynomial-time approximation algorithms, and finishing up with a list of selected case studies to show the wide range of applicability of the presented methodology.

Aimed at graduate and research mathematicians, programmers, algorithm designers, and computer scientists, the book introduces the basic techniques and results and provides a fresh view on this highly innovative field of algorithmic research.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

This research-level text is an application-oriented introduction to the growing and highly topical area of the development and analysis of efficient fixed-parameter algorithms for optimally solving computationally hard combinatorial problems. The book is divided into three parts: a broad introduction that provides the general philosophy and motivation; followed by coverage of algorithmic methods developed over the years in fixed-parameter algorithmics forming the core of the book; and a discussion of the essentials from parameterized hardness theory with a focus on W[1]-hardness which parallels NP-hardness, then stating some relations to polynomial-time approximation algorithms, and finishing up with a list of selected case studies to show the wide range of applicability of the presented methodology. Aimed at graduate and research mathematicians, programmers, algorithm designers, and computer scientists, the book introduces the basic techniques and results and provides a fresh view on this highly innovative field of algorithmic research.

Revue de presse

You will enjoy reading it whether you want to do research in the area or just want to learn about it. And while merily intending the latter, you are most likely going to end up doing the former when you finish reading it. (EMS Newsletter)

This book is an excellent introduction to the algorithmic aspects of the field (William Gasarch and Kin Keung Ma, The Computer Journal, Vol. 51 No. 1)

Niedermeier presents a wider range of concrete problems and pronlem variants, highlighting many algorithmic tricks and applications. (Daniel Marx, Mathematical Review)

The book is certainly value for money and I would highly recommend it as an essential purchase for a university library. (Journal of the Operational Research Society)

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
Oxford University Press
Date d'édition
2006
Langue
anglais
ISBN 10 
0198566077
ISBN 13 
9780198566076
Reliure
Relié
Nombre de pages
316
Coordonnées du fabricant
non disponible
Personne responsable
non disponible