Iterative Compression and Exact Algorithms - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Iterative Compression and Exact Algorithms

Résumé

Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. The main purpose of this paper is to show that iterative compression can also be used in the design of exact exponential time algorithms. We exemplify our findings with algorithms for the Maximum Independent Set problem, a counting version of k-Hitting Set and the Maximum Induced Cluster Subgraph problem.

Dates et versions

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

Identifiants

Citer

Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh. Iterative Compression and Exact Algorithms. MFCS'2008 : 33rd International Symposium on Mathematical Foundations of Computer Science, Aug 2008, Torun, Poland. pp.335-346, ⟨10.1007/978-3-540-85238-4_27⟩. ⟨hal-00460774⟩
122 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More