Iterative Compression for Exactly Solving NP-Hard Minimization Problems

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.

[1]  Meena Mahajan,et al.  Parametrizing Above Guaranteed Values: MaxSat and MaxCut , 1997, Electron. Colloquium Comput. Complex..

[2]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[3]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[4]  Luonan Chen,et al.  Models and Algorithms for Haplotyping Problem , 2006 .

[5]  Reuven Bar-Yehuda,et al.  Randomized Algorithms for the Loop Cutset Problem , 2000, J. Artif. Intell. Res..

[6]  Paul G. Spirakis,et al.  Algorithms — ESA '95 , 1995, Lecture Notes in Computer Science.

[7]  Eduardo Sany Laber,et al.  LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings , 2008, Lecture Notes in Computer Science.

[8]  S. Salzberg,et al.  Hierarchical scaffolding with Bambus. , 2003, Genome research.

[9]  Falk Hüffner,et al.  Algorithm Engineering for Optimal Graph Bipartization , 2005, J. Graph Algorithms Appl..

[10]  Barry O'Sullivan,et al.  Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract) , 2008, ICALP.

[11]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[12]  Panos M. Pardalos,et al.  Handbook of combinatorial optimization. Supplement , 2005 .

[13]  Joseph Naor,et al.  Approximating Minimum Feedback Sets and Multicuts in Directed Graphs , 1998, Algorithmica.

[14]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[15]  Andrew B. Kahng,et al.  New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout , 2001, ASP-DAC '01.

[16]  Hans L. Bodlaender,et al.  A Cubic Kernel for Feedback Vertex Set , 2007, STACS.

[17]  Jerzy Tyszkiewicz,et al.  Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings , 2008, MFCS.

[18]  Rolf Niedermeier,et al.  Fixed-parameter tractability results for feedback set problems in tournaments , 2010, J. Discrete Algorithms.

[19]  Michael R. Fellows,et al.  An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem , 2005, COCOON.

[20]  Saket Saurabh,et al.  Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques , 2007, Theory of Computing Systems.

[21]  Hans L. Bodlaender,et al.  On Disjoint Cycles , 1991, Int. J. Found. Comput. Sci..

[22]  Robert E. Tarjan,et al.  Faster Scaling Algorithms for Network Problems , 1989, SIAM J. Comput..

[23]  Dorothea Wagner,et al.  Algorithmics of Large and Complex Networks - Design, Analysis, and Simulation [DFG priority program 1126] , 2009, Algorithmics of Large and Complex Networks.

[24]  Mária Bieliková,et al.  SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings , 2008, SOFSEM.

[25]  Rolf Niedermeier,et al.  Fixed-Parameter Algo Algorithms for Kemeny Scores , 2008 .

[26]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[27]  Falk Hüffner,et al.  Parametrisierte Ansätze für schwere Graphprobleme: Algorithmen und ExperimenteAlgorithms and Experiments for Parameterized Approaches to Hard Graph Problems , 2009, it Inf. Technol..

[28]  Michael R. Fellows,et al.  Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover , 2004, IWPEC.

[29]  Juraj Hromkovic,et al.  On the Hardness of Reoptimization , 2008, SOFSEM.

[30]  Piotr Berman,et al.  A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem , 1999, SIAM J. Discret. Math..

[31]  Mihalis Yannakakis,et al.  Multiway Cuts in Directed and Node Weighted Graphs , 1994, ICALP.

[32]  Rolf Niedermeier,et al.  Techniques for Practical Fixed-Parameter Algorithms , 2007, Comput. J..

[33]  Jianer Chen,et al.  An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem , 2007, WADS.

[34]  Fedor V. Fomin,et al.  Iterative compression and exact algorithms , 2010, Theor. Comput. Sci..

[35]  Costas S. Iliopoulos,et al.  A New Efficient Algorithm for Computing the Longest Common Subsequence , 2007, AAIM.

[36]  Christian Komusiewicz,et al.  Fixed-Parameter Algorithms for Cluster Vertex Deletion , 2008, LATIN.

[37]  Rolf Niedermeier,et al.  Optimal Edge Deletions for Signed Graph Balancing , 2007, WEA.

[38]  Rolf Niedermeier,et al.  Data reduction and exact algorithms for clique cover , 2009, JEAL.

[39]  Sylvain Guillemot.  Parameterized Complexity and Approximability of the SLCS Problem , 2008, IWPEC.

[40]  Jianer Chen,et al.  Improved algorithms for feedback vertex set problems , 2008, J. Comput. Syst. Sci..

[41]  Niklaus Wirth,et al.  Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.

[42]  Shirley Dex,et al.  JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .

[43]  Rolf Niedermeier,et al.  Data Reduction, Exact, and Heuristic Algorithms for Clique Cover , 2006, ALENEX.

[44]  Barry O'Sullivan,et al.  Almost 2-SAT is Fixed-Parameter Tractable , 2008, J. Comput. Syst. Sci..

[45]  Michael R. Fellows,et al.  Analogs & duals of the MAST problem for sequences & trees , 2003, J. Algorithms.

[46]  Michael R. Fellows,et al.  Fixed Parameter Tractability and Completeness , 1992, Complexity Theory: Current Research.

[47]  Panos M. Pardalos,et al.  Feedback Set Problems , 1999, Handbook of Combinatorial Optimization.

[48]  Klaus Jansen,et al.  Experimental and Efficient Algorithms , 2003, Lecture Notes in Computer Science.

[49]  Barry O'Sullivan,et al.  A fixed-parameter algorithm for the directed feedback vertex set problem , 2008, STOC.

[50]  Dániel Marx.  Chordal Deletion is Fixed-Parameter Tractable , 2008, Algorithmica.

[51]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[52]  Andreas S. Schulz,et al.  0/1-Integer Programming: Optimization and Augmentation are Equivalent , 1995, ESA.

[53]  Fedor V. Fomin,et al.  Finding a Minimum Feedback Vertex Set in Time O (1.7548n) , 2006, IWPEC.

[54]  Rolf Niedermeier,et al.  Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation , 2005, Theory of Computing Systems.

[55]  Jianer Chen,et al.  Improved algorithms for feedback vertex set problems , 2007, J. Comput. Syst. Sci..

[56]  Bruce A. Reed,et al.  Finding odd cycle transversals , 2004, Oper. Res. Lett..

[57]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

[58]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[59]  Herbert S. Wilf,et al.  Algorithms and Complexity , 2010, Lecture Notes in Computer Science.

[60]  Stéphan Thomassé.  A quadratic kernel for feedback vertex set , 2009, SODA.

[61]  Rolf Niedermeier,et al.  Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization , 2006, J. Comput. Syst. Sci..

[62]  Dan Geiger,et al.  Approximation Algorithms for the Loop Cutset Problem , 1994, UAI.

[63]  Michael A. Langston,et al.  Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings , 2006, IWPEC.

[64]  Saket Saurabh,et al.  The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number , 2007, ISAAC.

[65]  Avrim Blum,et al.  Correlation Clustering , 2004, Machine Learning.