My Library

University LibraryCatalogue

Limit search to items available for borrowing or consultation
Result Page: Previous Next
Can't find that book? Try BONUS+
Look for full text

Search Discovery

Search CARM Centre Catalogue

Search Trove

Add record to RefWorks

Author Niedermeier, Rolf.

Title Invitation to fixed-parameter algorithms / Rolf Niedermeier.

Published Oxford : Oxford University Press, 2006.


Location Call No. Status
Physical description xi, 300 p. : ill. ; 24 cm.
Series Oxford lecture series in mathematics and its applications ; no. 31
Notes Formerly CIP. Uk
Bibliography Includes bibliographical references and index.
Summary "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."--Publisher's website.
Subject Algorithms.
Combinatorial analysis.
Parameter estimation.
ISBN 9780198566076 (hbk.) : £55.00
0198566077 (hbk.) : £55.00
Standard Number 9780198566076 (hbk.)