Iterative compression and exact algorithms

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.

• Type: Journal
• Year: 2010
• Where: TCS
• Authors: Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh
• Keywords: Cluster Subgraph Problem, Exact Exponential Time, Maximum Independent Set Problem, TCS 2010, Theoretical Computer Science