Iterative Compression and Exact Algorithms - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2010

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.

Dates and versions

hal-00460862 , version 1 (02-03-2010)

Identifiers

Cite

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⟩
57 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More