Invitation to Fixed Parameter Algorithms
Language: English
Published by OUP Oxford, 2006
Series: Book 9 of 16 - Oxford Lecture Series in Mathematics and Its Applications
- Hardcover
- New

Condition: New
US$ 285.76
Quantity: 2 available
Add to basketItem description from seller
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. Sprache: Englisch Gewicht in Gramm: 590.…
Seller Inventory # IB-22147413
- Title
- Invitation to Fixed Parameter Algorithms
- Author
- Rolf Niedermeier
- Publisher
- OUP Oxford
- Publication year
- 2006
- Condition
- Neu
- Binding
- Gebundene Ausgabe
- Language
- English
- ISBN 10
- 0198566077
- ISBN 13
- 9780198566076
- Item weight
- 590 grams
- Series
- Book 9 of 16: Oxford Lecture Series in Mathematics and Its Applications
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.
"Synopsis" may belong to another edition of this title.
About the Author
"About the title" may belong to another edition of this title.
Shipping rates from Germany to U.S.A.
| Item | 10 to 12 business days | 8 to 10 business days |
|---|---|---|
| First item | US$ 54.85 | US$ 82.45 |
Payment methods
- Check