Iterative Compression for Exactly Solving NP-Hard Minimization Problems [chapter]

Jiong Guo, Hannes Moser, Rolf Niedermeier
2009 Lecture Notes in Computer Science  
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.
doi:10.1007/978-3-642-02094-0_4 fatcat:ley2ifkrxbcw7bhzrktb5ijawq