Iterative compression and exact algorithms

Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh
2010 Theoretical Computer Science  
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.
doi:10.1016/j.tcs.2009.11.012 fatcat:xgs4a57pcbhhnkqrmlg3l2eata