Invitation to data reduction and problem kernelization

To solve NP-hard problems, polynomial-time preprocessing is a natural and promising approach. Preprocessing is based on data reduction techniques that take a problem's input instance and try to perform a reduction to a smaller, equivalent problem kernel. Problem kernelization is a methodology that is rooted in parameterized computational complexity. In this brief survey, we present data reduction and problem kernelization as a promising research field for algorithm and complexity theory.

[1]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[2]  Rolf Niedermeier,et al.  A general method to speed up fixed-parameter-tractable algorithms , 2000, Inf. Process. Lett..

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

[4]  Robert E. Bixby,et al.  Solving Real-World Linear Programs: A Decade and More of Progress , 2002, Oper. Res..

[5]  Michael R. Fellows,et al.  Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps , 2004, WG.

[6]  Jiong Guo.  A more effective linear kernelization for cluster editing , 2009, Theor. Comput. Sci..

[7]  Willard Van Orman Quine,et al.  The Problem of Simplifying Truth Functions , 1952 .

[8]  Irit Dinur,et al.  The importance of being biased , 2002, STOC '02.

[9]  Rolf Niedermeier,et al.  Parameterized Complexity of Generalized Vertex Cover Problems , 2005, WADS.

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

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

[12]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[13]  Venkatesan Guruswami,et al.  Clustering with qualitative information , 2005, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[14]  Rolf Niedermeier,et al.  Fixed‐parameter tractability and data reduction for multicut in trees , 2005, Networks.

[15]  Weijia Jia,et al.  Vertex Cover: Further Observations and Further Improvements , 2001, J. Algorithms.

[16]  Paolo Liberatore.  Monotonic reductions, representative equivalence, and compilation of intractable problems , 2001, JACM.

[17]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[18]  Ge Xia,et al.  Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size , 2005, STACS.

[19]  Michael R. Fellows,et al.  Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments , 2004, ALENEX/ANALC.

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

[21]  Michael R. Fellows,et al.  The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel , 2006, IWPEC.

[22]  Liming Cai,et al.  Advice Classes of Parameterized Tractability , 1997, Ann. Pure Appl. Log..

[23]  Dániel Marx,et al.  Parameterized Complexity and Approximation Algorithms , 2008, Comput. J..

[24]  Rolf Niedermeier,et al.  A General Data Reduction Scheme for Domination in Graphs , 2006, SOFSEM.

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

[26]  Michael R. Fellows,et al.  FPT is P-Time Extremal Structure I , 2005, ACiD.

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

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

[29]  Mark Weston.  A fixed-parameter tractable algorithm for matrix domination , 2004, Inf. Process. Lett..

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

[31]  Francesco M. Donini,et al.  Preprocessing of Intractable Problems , 2002, Inf. Comput..

[32]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[33]  Rolf Niedermeier,et al.  Polynomial-time data reduction for dominating set , 2002, JACM.

[34]  Peter Damaschke,et al.  Parameterized enumeration, transversals, and imperfect phylogeny reconstruction , 2004, Theor. Comput. Sci..

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