Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring

The NP-hard Interval Constrained Coloring (ICC) problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer intervals in the range 1 to n and a set of m associated multisets of colors (specifying for each interval the colors to be used for its elements), one asks whether there is a ''consistent'' coloring for all integer points from {1,...,n} that complies with the constraints specified by the color multisets. We thoroughly analyze a known NP-hardness proof for ICC. In this way, we identify numerous parameters that naturally occur in ICC and strongly influence its practical solvability. Accordingly, we present several positive (fixed-parameter) tractability results exploiting various parameterizations. We substantiate the usefulness of this ''multivariate algorithmics approach'' by presenting experimental results with real-world data.

[1]  Rolf Niedermeier,et al.  Reflections on Multivariate Algorithmics and Problem Parameterization , 2010, STACS.

[2]  András Frank,et al.  An application of simultaneous diophantine approximation in combinatorial optimization , 1987, Comb..

[3]  Jirí Fiala,et al.  Parameterized complexity of coloring problems: Treewidth versus vertex cover , 2009, Theor. Comput. Sci..

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

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

[6]  Samir Khuller,et al.  Broadcast scheduling: Algorithms and complexity , 2008, TALG.

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

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

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

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

[11]  David Eppstein,et al.  3-Coloring in Time O(1.3289^n) , 2000, J. Algorithms.

[12]  W. Marsden.  I and J , 2012 .

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

[14]  Khaled M. Elbassioni,et al.  A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring Problem , 2010, ALENEX.

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

[16]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

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

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

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