Iterative Compression and Exact Algorithms

Authors:
Fedor V. Fomin;Serge Gaspers;Dieter Kratsch;Mathieu Liedloff;Saket Saurabh
Affiliations:
Department of Informatics, University of Bergen, Bergen, Norway N-5020;Department of Informatics, University of Bergen, Bergen, Norway N-5020;Laboratoire d'Informatique Théorique et Appliquée, Université Paul Verlaine - Metz, Metz Cedex 01, France 57045;Laboratoire d'Informatique Théorique et Appliquée, Université Paul Verlaine - Metz, Metz Cedex 01, France 57045;Department of Informatics, University of Bergen, Bergen, Norway N-5020
Venue:
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Year:
2008

Citing 15
Cited 2

On generating all maximal independent sets

Information Processing Letters
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)
Measure and conquer: a simple O(20.288n) independent set algorithm

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Inclusion--Exclusion Algorithms for Counting Set Partitions

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization

Journal of Computer and System Sciences
Fourier meets möbius: fast subset convolution

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques

Theory of Computing Systems
A fixed-parameter algorithm for the directed feedback vertex set problem

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Fixed-parameter algorithms for cluster vertex deletion

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem*

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Parameterized algorithms for HITTING SET: the weighted case

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
The cluster editing problem: implementations and experiments

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Efficient parameterized preprocessing for cluster editing

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
A more effective linear kernelization for Cluster Editing

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Iterative Compression for Exactly Solving NP-Hard Minimization Problems

Algorithmics of Large and Complex Networks
Parameterized approximation algorithms for hitting set

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. The main purpose of this paper is to show that iterative compression can also be used in the design of exact exponential time algorithms. We exemplify our findings with algorithms for the Maximum Independent Setproblem, a counting version of k-Hitting Setand the Maximum Induced Cluster Subgraphproblem.