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. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Fomin, F. V., Gaspers, S., Kratsch, D., Liedloff, M., & Saurabh, S. (2008). Iterative compression and exact algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5162 LNCS, pp. 335–346). https://doi.org/10.1007/978-3-540-85238-4_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
