Iterative compression and exact algorithms

Authors:
Fedor V. Fomin;Serge Gaspers;Dieter Kratsch;Mathieu Liedloff;Saket Saurabh
Affiliations:
Department of Informatics, University of Bergen, N-5020 Bergen, Norway;Centro de Modelamiento Matemático, Universidad de Chile, 8370459 Santiago de Chile, Chile;Laboratoire dInformatique Théorique et Appliquée, Université Paul Verlaine - Metz, 57045 Metz Cedex 01, France;Laboratoire dInformatique Fondamentale dOrléans, Université dOrléans, 45067 Orléans Cedex 2, France;Institute of Mathematical Sciences, CIT Campus, Taramani, 600 113 Chennai, India
Venue:
Theoretical Computer Science
Year:
2010

Citing 21
Cited 4

On generating all maximal independent sets

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

Journal of the ACM (JACM)
Exact algorithms for NP-hard problems: a survey

Combinatorial optimization - Eureka, you shrink!
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
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem

Theory of Computing Systems
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

Journal of the ACM (JACM)
Improved algorithms for feedback vertex set problems

Journal of Computer and System Sciences
A more effective linear kernelization for cluster editing

Theoretical Computer Science
A measure & conquer approach for the analysis of exact algorithms

Journal of the ACM (JACM)
Fixed-parameter algorithms for cluster vertex deletion

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Parameterized algorithms for HITTING SET: the weighted case

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Improved parameterized upper bounds for vertex cover

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The cluster editing problem: implementations and experiments

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Finding odd cycle transversals

Operations Research Letters
Enumerating maximal independent sets with applications to graph colouring

Operations Research Letters
Efficient parameterized preprocessing for cluster editing

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory

Feedback vertex sets in tournaments

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
On computing the minimum 3-path vertex cover and dissociation number of graphs

Theoretical Computer Science
Cluster vertex deletion: a parameterization between vertex cover and clique-width

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Feedback Vertex Sets in Tournaments

Journal of Graph Theory

Quantified Score

Hi-index	5.23

Visualization

Abstract

Iterative compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponential time algorithms to solve NP-hard problems. We exemplify our findings with algorithms for the Maximum Independent Set problem, a parameterized and a counting version of d-Hitting Set and the Maximum Induced Cluster Subgraph problem.