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

Book Cover
PRINTED BOOKS
Author Niedermeier, Rolf.

Title Invitation to fixed-parameter algorithms / Rolf Niedermeier.

Published Oxford : Oxford University Press, 2006.

Copies

Location Call No. Status
 UniM ERC  518.1 NIED    AVAILABLE
Physical description xi, 300 pages : illustrations ; 24 cm.
Series Oxford lecture series in mathematics and its applications ; no. 31.
Oxford lecture series in mathematics and its applications ; no. 31.
Notes Formerly CIP. Uk.
Bibliography Includes bibliographical references and index.
Contents 1 Introduction to Fixed-Parameter Algorithms 3 -- 2 Preliminaries and Agreements 17 -- 3 Parameterized Complexity Theory-A Primer 22 -- 4 Vertex Cover-An Illustrative Example 31 -- 5 Art of Problem Parameterization 41 -- II Algorithmic Methods -- 7 Data Reduction and Problem Kernels 53 -- 8 Depth-Bounded Search Trees 88 -- 9 Dynamic Programming 124 -- 10 Tree Decompositions of Graphs 150 -- 11 Further Advanced Techniques 177 -- III Some Theory, Some Case Studies -- 13 Parameterized Complexity Theory 205 -- 14 Connections to Approximation Algorithms 237 -- 15 Selected Case Studies 243 -- 16 Zukunftsmusik 277.
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.
Standard Number 9780198566076 (hbk.)
ISBN 9780198566076 (hbk.) £55.00
0198566077 (hbk.) £55.00