Fundamentals of Parameterized Complexity

  • Rodney G. Downey
  • Michael R. Fellows
Part of the Texts in Computer Science book series (TCS)

Table of contents

  1. Front Matter
    Pages I-XXX
  2. Parameterized Tractability

    1. Front Matter
      Pages 1-1
    2. Rodney G. Downey, Michael R. Fellows
      Pages 3-13
    3. Rodney G. Downey, Michael R. Fellows
      Pages 15-21
  3. Elementary Positive Techniques

    1. Front Matter
      Pages 23-23
    2. Rodney G. Downey, Michael R. Fellows
      Pages 25-47
    3. Rodney G. Downey, Michael R. Fellows
      Pages 49-89
    4. Rodney G. Downey, Michael R. Fellows
      Pages 91-106
    5. Rodney G. Downey, Michael R. Fellows
      Pages 107-130
    6. Rodney G. Downey, Michael R. Fellows
      Pages 131-141
    7. Rodney G. Downey, Michael R. Fellows
      Pages 143-170
    8. Rodney G. Downey, Michael R. Fellows
      Pages 171-182
  4. Techniques Based on Graph Structure

    1. Front Matter
      Pages 183-183
    2. Rodney G. Downey, Michael R. Fellows
      Pages 185-203
    3. Rodney G. Downey, Michael R. Fellows
      Pages 205-211
    4. Rodney G. Downey, Michael R. Fellows
      Pages 213-264
    5. Rodney G. Downey, Michael R. Fellows
      Pages 265-278
    6. Rodney G. Downey, Michael R. Fellows
      Pages 279-289
    7. Rodney G. Downey, Michael R. Fellows
      Pages 291-300
    8. Rodney G. Downey, Michael R. Fellows
      Pages 301-316

About this book

Introduction

The field of parameterized complexity/multivariate complexity algorithmics is an exciting and vibrant part of theoretical computer science, responding to the vital need for efficient algorithms in modern society.

This comprehensive and self-contained textbook presents an accessible overview of the state of the art of multivariate algorithmics and complexity. Increasingly, multivariate algorithmics is having significant practical impact in many application domains, with even more developments on the horizon. The text describes how the multivariate framework allows an extended dialog with a problem, enabling the reader who masters the complexity issues under discussion to use the positive and negative toolkits in their own research.

Topics and features:

  • Describes many of the standard algorithmic techniques available for establishing parametric tractability
  • Reviews the classical hardness classes
  • Explores the various limitations and relaxations of the methods
  • Showcases the powerful new lower bound techniques
  • Examines various different algorithmic solutions to the same problems, highlighting the insights to be gained from each approach
  • Demonstrates how complexity methods and ideas have evolved over the past 25 years

This classroom-tested and easy-to-follow textbook/reference is essential reading for the beginning graduate student and advanced undergraduate student. The book will also serve as an invaluable resource for the general computer scientist and the mathematically-aware scientist seeking tools for their research.

Keywords

Computational Complexity Graph Theory Hardness Theory Kernelization Lower Bounds Multivariate Algorithmics Parameterized Tractability

Authors and affiliations

  • Rodney G. Downey
    • 1
  • Michael R. Fellows
    • 2
  1. 1.School of Mathematics, Statistics and Operations ResearchVictoria UniversityWellingtonNew Zealand
  2. 2.School of Engineering and Information TechnologyCharles Darwin UniversityDarwinAustralia

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4471-5559-1
  • Copyright Information Springer-Verlag London 2013
  • Publisher Name Springer, London
  • eBook Packages Computer Science
  • Print ISBN 978-1-4471-5558-4
  • Online ISBN 978-1-4471-5559-1
  • Series Print ISSN 1868-0941
  • Series Online ISSN 1868-095X
  • About this book