Reflections on Multivariate Algorithmics and Problem Parameterization

Research on parameterized algorithmics for NP-hard problems has steadily grown over the last years. We survey and discuss how parameterized complexity analysis naturally develops into the field of multivariate algorithmics. Correspondingly, we describe how to perform a systematic investigation and exploitation of the ``parameter space'' of computationally hard problems.

[1]  Dániel Marx,et al.  Closest Substring Problems with Small Distances , 2008, SIAM J. Comput..

[2]  Rolf Niedermeier,et al.  Iterative Compression for Exactly Solving NP-Hard Minimization Problems , 2009, Algorithmics of Large and Complex Networks.

[3]  Michael R. Fellows,et al.  The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number , 2007, Theory of Computing Systems.

[4]  Rolf Niedermeier,et al.  On The Parameterized Intractability Of Motif Search Problems* , 2002, Comb..

[5]  Leizhen Cai,et al.  Parameterized Complexity of Vertex Colouring , 2003, Discret. Appl. Math..

[6]  Christian Komusiewicz,et al.  Deconstructing Intractability: A Case Study for Interval Constrained Coloring , 2009, CPM.

[7]  Rolf Niedermeier,et al.  Parameterized Intractability of Distinguishing Substring Selection , 2006, Theory of Computing Systems.

[8]  Rolf Niedermeier,et al.  Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems , 2003, Algorithmica.

[9]  Michael R. Fellows,et al.  Graph Layout Problems Parameterized by Vertex Cover , 2008, ISAAC.

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

[11]  Stefan Kratsch,et al.  Graph isomorphism parameterized by feedback vertex set number is fixed-parameter tractable , 2009 .

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

[13]  Michael R. Fellows,et al.  Local Search: Is Brute-Force Avoidable? , 2009, IJCAI.

[14]  Hans L. Bodlaender,et al.  Kernelization: New Upper and Lower Bound Techniques , 2009, IWPEC.

[15]  Narges Simjour.  Improved Parameterized Algorithms for the Kemeny Aggregation Problem , 2009, IWPEC.

[16]  Rolf Niedermeier,et al.  Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes , 2009, SEA.

[17]  Noga Alon,et al.  Solving MAX-r-SAT Above a Tight Lower Bound , 2010, SODA '10.

[18]  Günter Rote,et al.  The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension , 2009, IWPEC.

[19]  Dimitrios M. Thilikos,et al.  Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..

[20]  Rolf Niedermeier,et al.  Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms , 2004, MFCS.

[21]  Günter Rote,et al.  Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension , 2008, SODA '08.

[22]  Noga Alon,et al.  Fast Fast , 2009, ICALP.

[23]  Rolf Niedermeier,et al.  Invitation to data reduction and problem kernelization , 2007, SIGA.

[24]  Liming Cai,et al.  Parameterized Complexity and Biopolymer Sequence Comparison , 2008, Comput. J..

[25]  Ge Xia,et al.  Tight lower bounds for certain parameterized NP-hard problems , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[26]  Dániel Marx,et al.  Searching the k-change neighborhood for TSP is W[1]-hard , 2008, Oper. Res. Lett..

[27]  Russell L. Malmberg,et al.  Efficient Parameterized Algorithm for Biopolymer Structure-Sequence Alignment , 2005, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[28]  Nadja Betzler.  On Problem Kernels for Possible Winner Determination under the k-Approval Protocol , 2010, MFCS.

[29]  Christian Komusiewicz,et al.  Average parameterization and partial kernelization for computing medians , 2010, J. Comput. Syst. Sci..

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

[31]  Jianer Chen,et al.  On Parameterized Intractability: Hardness and Completeness , 2008, Comput. J..

[32]  Nadja Betzler,et al.  Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules , 2009, MFCS.

[33]  Meena Mahajan,et al.  Parameterizing above or below guaranteed values , 2009, J. Comput. Syst. Sci..

[34]  Michael Hoffmann,et al.  The Minimum Weight Triangulation Problem with Few Inner Points , 2004, IWPEC.

[35]  Dániel Marx,et al.  Parameterized coloring problems on chordal graphs , 2004, Theor. Comput. Sci..

[36]  Ernst Althaus,et al.  Approximating the Interval Constrained Coloring Problem , 2008, SWAT.

[37]  Mam Riess Jones.  Color Coding , 1962, Human factors.

[38]  Bin Ma,et al.  More Efficient Algorithms for Closest String and Substring Problems , 2008, SIAM J. Comput..

[39]  Samir Khuller,et al.  On local search and placement of meters in networks , 2000, SODA '00.

[40]  Robert Bredereck,et al.  Fixed-Parameter Algorithms for Computing Kemeny Scores - Theory and Practice , 2010, ArXiv.

[41]  Rolf Niedermeier,et al.  A logic for causal reasoning , 2003, IJCAI 2003.

[42]  Rolf Niedermeier,et al.  A Structural View on Parameterizing Problems: Distance from Triviality , 2004, IWPEC.

[43]  Lusheng Wang,et al.  Efficient Algorithms for the Closest String and Distinguishing String Selection Problems , 2009, FAW.

[44]  Georg Gottlob,et al.  Width Parameters Beyond Tree-width and their Applications , 2008, Comput. J..

[45]  Gerhard J. Woeginger,et al.  The Traveling Salesman Problem with Few Inner Points , 2004, COCOON.

[46]  A. Litman,et al.  On covering problems of codes , 1997, Theory of Computing Systems.

[47]  Sergio Cabello,et al.  On the parameterized complexity of d-dimensional point set pattern matching , 2006, Inf. Process. Lett..

[48]  Moni Naor,et al.  Rank aggregation methods for the Web , 2001, WWW '01.

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

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

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

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

[53]  Arie M. C. A. Koster,et al.  Combinatorial Optimization on Graphs of Bounded Treewidth , 2008, Comput. J..

[54]  Michael R. Fellows,et al.  Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology , 2009, IWOCA.

[55]  Christian Knauer,et al.  Testing the congruence of d-dimensional point sets , 2000, SCG '00.

[56]  Jan Arne Telle,et al.  An Overview of Techniques for Designing Parameterized Algorithms , 2008, Comput. J..

[57]  Sue Whitesides,et al.  Parameterized Complexity of Geometric Problems , 2008, Comput. J..

[58]  Ge Xia,et al.  Improved Parameterized Upper Bounds for Vertex Cover , 2006, MFCS.

[59]  Huimin Zhang,et al.  Computing H/D-exchange speeds of single residues from data of peptic fragments , 2008, SAC '08.

[60]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .