Towards a taxonomy of techniques for designing parameterized algorithms

Authors:
Christian Sloper;Jan Arne Telle
Affiliations:
Department of Informatics, University of Bergen, Norway;Department of Informatics, University of Bergen, Norway
Venue:
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Year:
2006

Citing 15
Cited 1

The spatial complexity of oblivious k-probe Hash functions

SIAM Journal on Computing
Color-coding

Journal of the ACM (JACM)
Parameterizing above guaranteed values: MaxSat and MaxCut

Journal of Algorithms
A general method to speed up fixed-parameter-tractable algorithms

Information Processing Letters
Investigations on autark assignments

Discrete Applied Mathematics - Special issue on Boolean functions and related problems
Introduction to Algorithms: A Creative Approach

Introduction to Algorithms: A Creative Approach
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems

FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Lean clause-sets: generalizations of minimally unsatisfiable clause-sets

Discrete Applied Mathematics - The renesse issue on satisfiability
An efficient parameterized algorithm for m-set packing

Journal of Algorithms
Bidimensionality: new connections between FPT algorithms and PTASs

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The method of extremal structure on the k-maximum cut problem

CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Reducing to independent set structure: the case of k-internal spanning tree

Nordic Journal of Computing
Finding k disjoint triangles in an arbitrary graph

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Finding odd cycle transversals

Operations Research Letters
Parameterized Complexity

Parameterized Complexity

Parameterized derandomization

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A survey is given of the main techniques in parameterized algorithm design, with a focus on formal descriptions of the less familiar techniques. A taxonomy of techniques is proposed, under the four main headings of Branching, Kernelization, Induction and Win/Win. In this classification the Extremal Method is viewed as the natural maximization counterpart of Iterative Compression, under the heading of Induction. The formal description given of Greedy Localization generalizes the application of this technique to a larger class of problems.