Parameterized Algorithms

  • Marek Cygan
  • Fedor V. Fomin
  • Łukasz Kowalik
  • Daniel Lokshtanov
  • Dániel Marx
  • Marcin Pilipczuk
  • Michał Pilipczuk
  • Saket Saurabh

Table of contents

  1. Front Matter
    Pages i-xvii
  2. Basic Toolbox

    1. Front Matter
      Pages 1-1
    2. Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk et al.
      Pages 3-15
    3. Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk et al.
      Pages 17-49
    4. Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk et al.
      Pages 51-76
    5. Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk et al.
      Pages 77-98
    6. Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk et al.
      Pages 99-127
    7. Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk et al.
      Pages 129-150
    8. Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk et al.
      Pages 151-244
  3. Advanced Algorithmic Techniques

    1. Front Matter
      Pages 245-245
    2. Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk et al.
      Pages 247-284
    3. Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk et al.
      Pages 285-319
    4. Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk et al.
      Pages 321-355
    5. Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk et al.
      Pages 357-375
    6. Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk et al.
      Pages 377-418
  4. Lower Bounds

    1. Front Matter
      Pages 419-419
    2. Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk et al.
      Pages 421-465
    3. Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk et al.
      Pages 467-521
    4. Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk et al.
      Pages 523-555
  5. Back Matter
    Pages 556-613

About this book

Introduction

This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut & Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way.

The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. Part III presents complexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds.

All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work.

Keywords

Branching Fixed-parameter tractability (FPT); Integer linear programming (ILP) Kernels Matroids Parameterized algorithms Parameterized complexity Treewidth

Authors and affiliations

  • Marek Cygan
    • 1
  • Fedor V. Fomin
    • 2
  • Łukasz Kowalik
    • 3
  • Daniel Lokshtanov
    • 4
  • Dániel Marx
    • 5
  • Marcin Pilipczuk
    • 6
  • Michał Pilipczuk
    • 7
  • Saket Saurabh
    • 8
  1. 1.Institute of InformaticsUniversity of WarsawWarsawPoland
  2. 2.Dept. of InformaticsUniversity of BergenBergenNorway
  3. 3.Institute of InformaticsUniversity of WarsawWarsawPoland
  4. 4.Department of InformaticsUniversity of BergenBergenNorway
  5. 5.Inst. for Computer Science & ControlHungarian Academy of SciencesBudapestHungary
  6. 6.Institute of InformaticsUniversity of WarsawWarsawPoland
  7. 7.Institute of InformaticsUniversity of WarsawWarsawPoland
  8. 8.C.I.T. CampusThe Institute of Mathematical SciencesChennaiIndia

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-21275-3
  • Copyright Information Springer International Publishing Switzerland 2015
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-21274-6
  • Online ISBN 978-3-319-21275-3
  • About this book