Invitation to Fixed-Parameter Algorithms | Zookal Textbooks | Zookal Textbooks
  • Author(s) Rolf Niedermeier
  • Edition
  • Published1st January 2006
  • PublisherOxford University Press UK
  • ISBN9780198566076
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.

Invitation to Fixed-Parameter Algorithms

Format
In stock at supplier

Leaves in 1-4 weeks

$155.79 $186.95 Save $31.16
or 4 payments of $38.94 with Zookal accepts Afterpay
Add Zookal Study FREE trial and save a further 20% 

NEW PRICE

$124.63 + free shipping

(20% off - save $31.16)

Zookal Study Free trial

14-day FREE trial. $14.95/mo after. Cancel anytime.

*Discount will apply at checkout.

 See terms and conditions

You will get a further 20% off for this item ($124.63 after discount) because you have added Zookal Study Premium Free Trial to your bag.

For this discount to apply, you will need to complete checkout with the Zookal Study Premium Free Trial in your bag.

-
+
  • Author(s) Rolf Niedermeier
  • Edition
  • Published1st January 2006
  • PublisherOxford University Press UK
  • ISBN9780198566076
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.
translation missing: en.general.search.loading