We survey the conceptual framework and several applications of the iterative compression technique introduced in 2004 by Reed, Smith, and Vetta. This technique has proven very useful for achieving a number of recent breakthroughs in the development of fixed-parameter algorithms for NP-hard minimization problems. There is a clear potential for further applications as well as a further development of the technique itself. We describe several algorithmic results based on iterative compression and point out some challenges for future research. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Guo, J., Moser, H., & Niedermeier, R. (2009). Iterative compression for exactly solving NP-hard minimization problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5515 LNCS, pp. 65–80). https://doi.org/10.1007/978-3-642-02094-0_4
Mendeley helps you to discover research relevant for your work.