Fomin, Fedor V. ; Gaspers, Serge ; Kratsch, Dieter ; Liedloff, Mathieu ; Saurabh, Saket (2008) Iterative Compression and Exact Algorithms Lecture Notes in Computer Science, 5162 . pp. 335-346. ISSN 0302-9743
Full text not available from this repository.
Official URL: http://doi.org/10.1007/978-3-540-85238-4_27
Related URL: http://dx.doi.org/10.1007/978-3-540-85238-4_27
Abstract
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.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Springer-Verlag. |
| ID Code: | 123474 |
| Deposited On: | 20 Sep 2021 10:44 |
| Last Modified: | 20 Sep 2021 10:44 |
Repository Staff Only: item control page
