Iterative Compression and Exact Algorithms

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.
Document type :
Journal articles
Theoretical Computer Science, Elsevier, 2010, 411 (7-9), pp.1045-1053. 〈10.1016/j.tcs.2009.11.012〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00460862
Contributor : Mathieu Liedloff <>
Submitted on : Tuesday, March 2, 2010 - 4:30:15 PM
Last modification on : Thursday, January 17, 2019 - 3:06:04 PM

Links full text

Identifiers

Citation

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

Share

Metrics

Record views

107