 |
|
|
|
| HAL: hal-00460862, version 1 |
| DOI: 10.1016/j.tcs.2009.11.012 |
| Detailed view |  Export this paper |
|
|
| Theoretical Computer Science 411, 7-9 (2010) 1045-1053 |
|
|
|
|
| Iterative Compression and Exact Algorithms |
|
|
| Fedor V. Fomin 1Serge Gaspers 2 |
|
|
| (2010-02-28) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Department of Informatics |
|
|
|
University of Bergen |
|
|
| 2: | Centre de Modélisation Mathématique / Centro de Modelamiento Matemático (CMM) |
|
|
|
CNRS : UMR2071 |
|
|
| 3: | Laboratoire d'Informatique Théorique et Appliquée (LITA) |
|
|
|
Université Paul Verlaine - Metz |
|
|
| 4: | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
|
|
|
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges |
|
|
| 5: | Institute of Mathematical Sciences [India] (IMSc) |
|
|
|
Institute of Mathematical Sciences |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Data Structures and Algorithms |
| hal-00460862, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00460862 | |
| oai:hal.archives-ouvertes.fr:hal-00460862 | |
| From: Mathieu Liedloff | |
| Submitted on: Tuesday, 2 March 2010 16:30:15 | |
| Updated on: Tuesday, 2 March 2010 16:30:15 | |
