Invitation to Fixed Parameter Algorithms
(Sprache: Englisch)
A fixed-parameter is an algorithm that provides an optimal solution to a combinatorial problem. This research-level text is an application-oriented introduction to the growing and highly topical area of the development and analysis of efficient...
Leider schon ausverkauft
versandkostenfrei
Buch
89.27 €
44 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „Invitation to Fixed Parameter Algorithms “
A fixed-parameter is an algorithm that provides an optimal solution to a combinatorial problem. 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 hard 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 essential 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.
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 essential 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.
Inhaltsverzeichnis zu „Invitation to Fixed Parameter Algorithms “
PART I: FOUNDATIONS ; 1. Introduction to Fixed-Parameter Algorithms ; 2. Preliminaries and Agreements ; 3. Parameterized Complexity Theory - A Primer ; 4. Vertex Cover - An Illustrative Example ; 5. The Art of Problem Parameterization ; 6. Summary and Concluding Remarks ; PART II: ALGORITHMIC METHODS ; 7. Data Reduction and Problem Kernels ; 8. Depth-Bounded Search Trees ; 9. Dynamic Programming ; 10. Tree Decompositions of Graphs ; 11. Further Advanced Techniques ; 12. Summary and Concluding Remarks ; PART III: SOME THEORY, SOME CASE STUDIES ; 13. Parameterized Complexity Theory ; 14. Connections to Approximation Algorithms ; 15. Selected Case Studies ; 16. Zukunftsmusik ; References ; Index
Bibliographische Angaben
- Autor: Rolf Niedermeier
- 2006, 312 Seiten, Maße: 16,1 x 24,1 cm, Gebunden, Englisch
- Verlag: OXFORD UNIV PR
- ISBN-10: 0198566077
- ISBN-13: 9780198566076
Sprache:
Englisch
Rezension zu „Invitation to Fixed Parameter Algorithms “
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
Kommentar zu "Invitation to Fixed Parameter Algorithms"
0 Gebrauchte Artikel zu „Invitation to Fixed Parameter Algorithms“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Invitation to Fixed Parameter Algorithms".
Kommentar verfassen