Iterative Compression and Exact Algorithms

Fedor V. Fomin (1) , Serge Gaspers (2) , Dieter Kratsch (3) , Mathieu Liedloff (4) , Saket Saurabh (5)

1 UiB - Department of Informatics [Bergen]
2 CMM - Centre de modélisation mathématique / Centro de Modelamiento Matemático [Santiago]
3 LITA - Laboratoire d'Informatique Théorique et Appliquée
4 LIFO - Laboratoire d'Informatique Fondamentale d'Orléans
5 IMSc - Institute of Mathematical Sciences [Chennai]

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.

Domaines: Algorithme et structure de données [cs.DS]

Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh. Iterative Compression and Exact Algorithms. Theoretical Computer Science, 2010, 411 (7-9), pp.1045-1053. ⟨10.1016/j.tcs.2009.11.012⟩. ⟨hal-00460862⟩