Invitation to Fixed-Parameter Algorithms
Author:   Rolf Niedermeier (Universitaet Jena)
Publisher:   Oxford University Press
Volume:   31
ISBN:  

9780198566076


Pages:   316
Publication Date:   02 February 2006
Format:   Hardback
Availability:   To order   Availability explained
Stock availability from the supplier is unknown. We will order it for you and ship this item to you once it is received by us.

Our Price $279.00 Quantity:  
Add to Cart

Share |

Invitation to Fixed-Parameter Algorithms


Overview

Full Product Details

Author:   Rolf Niedermeier (Universitaet Jena)
Publisher:   Oxford University Press
Imprint:   Oxford University Press
Volume:   31
Dimensions:   Width: 16.20cm , Height: 2.20cm , Length: 24.20cm
Weight:   0.612kg
ISBN:  

9780198566076


ISBN 10:   0198566077
Pages:   316
Publication Date:   02 February 2006
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   To order   Availability explained
Stock availability from the supplier is unknown. We will order it for you and ship this item to you once it is received by us.

Table of Contents

Part I: Foundations 1: Introduction to Fixed-Parameter Algorithms 2: Preliminaries and Agreements 3: Parameterized Complexity Theory - A Primer 4: Vertex Cover - An Illustrative Example 5: The Art of Problem Parameterization 6: Summary and Concluding Remarks Part II: Algorithmic Methods 7: Data Reduction and Problem Kernels 8: Depth-Bounded Search Trees 9: Dynamic Programming 10: Tree Decompositions of Graphs 11: Further Advanced Techniques 12: Summary and Concluding Remarks Part III: Some Theory, Some Case Studies 13: Parameterized Complexity Theory 14: Connections to Approximation Algorithms 15: Selected Case Studies 16: Zukunftsmusik References Index

Reviews

You will enjoy reading it whether you want to do research in the area or just want to learn about it. And while merily intending the latter, you are most likely going to end up doing the former when you finish reading it. EMS Newsletter This book is an excellent introduction to the algorithmic aspects of the field William Gasarch and Kin Keung Ma, The Computer Journal, Vol. 51 No. 1 Niedermeier presents a wider range of concrete problems and pronlem variants, highlighting many algorithmic tricks and applications. Daniel Marx, Mathematical Review


This book is an excellent introduction to the algorithmic aspects of the field William Gasarch and Kin Keung Ma, The Computer Journal, Vol. 51 No. 1 Niedermeier presents a wider range of concrete problems and pronlem variants, highlighting many algorithmic tricks and applications. Daniel Marx, Mathematical Review


Author Information

Tab Content 6

Author Website:  

Countries Available

All regions
Latest Reading Guide

NOV RG 20252

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now