Invitation to Fixed-Parameter Algorithms

Usually delivers within 2 weeks.

Description

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.

Product Details

Price
£112.50
Publisher
Oxford University Press
Publish Date
Language
English
Type
Hardback
EAN/UPC
9780198566076
BIC Categories:

Earn By Promoting Books

Earn money by sharing your favourite books through our Affiliate programme.

Become an Affiliate
We use cookies and similar methods to recognize visitors and remember their preferences. We also use them to help detect unauthorized access or activity that violate our terms of service, as well as to analyze site traffic and performance for our own site improvement efforts. To learn more about these methods, including how to disable them view our Cookie Policy.