Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring

Journal of Discrete Algorithms

Volumn 9, Issue 1, 2011, Pages 137-151

  Komusiewicz, Christian ^a   Niedermeier, Rolf ^a   Uhlmann, Johannes ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

Experiments; Interval constraint coloring; Multivariate algorithmics; NP hard problem; Parametrized complexity

Indexed keywords

ALGORITHMICS; COMPLEXITY ANALYSIS; EXPERIMENTAL DATA; INTEGER POINT; INTERVAL CONSTRAINT; MULTI-SETS; NP-HARD; NP-HARD PROBLEM; NP-HARDNESS; PARAMETERIZATIONS; PARAMETRIZED COMPLEXITY; PROTEIN FRAGMENTS; REAL WORLD DATA;

COLOR; COLORING; EXPERIMENTS; MULTIVARIANT ANALYSIS;

COMPUTATIONAL COMPLEXITY;

EID: 79551608264     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2010.07.003     Document Type: Conference Paper

References (18)

1. E. Althaus, S. Canzar, K. Elbassioni, A. Karrenbauer, and J. Mestre Approximating the interval constrained coloring problem Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT '08) Lecture Notes in Computer Science vol. 5124 2008 Springer 210 221
2. E. Althaus, S. Canzar, M.R. Emmett, A. Karrenbauer, A.G. Marshall, A. Meyer-Baese, and H. Zhang Computing H/D-exchange speeds of single residues from data of peptic fragments Proceedings of the 23rd ACM Symposium on Applied Computing (SAC '08) 2008 ACM 1273 1277
3. R. Beigel, and D. Eppstein 3-coloring in time O (1.3289 n ) Journal of Algorithms 54 2 2005 168 204
4. H.L. Bodlaender Kernelization: New upper and lower bound techniques Proceedings of the 4th International Workshop on Parameterized and Exact Computation (IWPEC'09) Lecture Notes in Computer Science vol. 5917 2009 Springer 17 37
5. J. Byrka, A. Karrenbauer, and L. Sanità The interval constrained 3-coloring problem Proceedings of the 9th Latin American Theoretical Informatics Symposium (LATIN'10) Lecture Notes in Computer Science vol. 6034 2010 Springer 591 602
6. S. Canzar, K. Elbassioni, and J. Mestre A polynomial delay algorithm for enumerating approximate solutions to the interval constrained coloring problem Proceedings of the 12th Workshop on Algorithm Engineering and Experiments (ALENEX'10) 2010 SIAM 23 33
7. J. Chang, T. Erlebach, R. Gailis, and S. Khuller Broadcast scheduling: Algorithms and complexity Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA '08) 2008 ACM-SIAM 473 482
8. R.G. Downey, and M.R. Fellows Parameterized Complexity 1999 Springer
9. M.R. Fellows Towards fully multivariate algorithmics: Some new results and directions in parameter ecology Proceedings of the 20th International Workshop on Combinatorial Algorithms (IWOCA'09) Lecture Notes in Computer Science vol. 5874 2009 Springer 2 10
10. M.R. Fellows, D. Lokshtanov, N. Misra, F.A. Rosamond, and S. Saurabh Graph layout problems parameterized by vertex cover Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC '08) Lecture Notes in Computer Science vol. 5369 2008 Springer 294 305
11. J. Fiala, P.A. Golovach, and J. Kratochvíl Parameterized complexity of coloring problems: Treewidth versus vertex cover Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (TAMC'09) Lecture Notes in Computer Science vol. 5532 2009 Springer 221 230
12. J. Flum, and M. Grohe Parameterized Complexity Theory 2006 Springer
13. A. Frank, and É. Tardos An application of simultaneous Diophantine approximation in combinatorial optimization Combinatorica 7 1 1987 49 65
14. J. Gramm, R. Niedermeier, and P. Rossmanith Fixed-parameter algorithms for Closest String and related problems Algorithmica 37 1 2003 25 42
15. J. Guo, and R. Niedermeier Invitation to data reduction and problem kernelization ACM SIGACT News 38 1 2007 31 45
16. H.W. Lenstra Integer programming with a fixed number of variables Mathematics of Operations 8 1983 538 548
17. R. Niedermeier Invitation to Fixed-Parameter Algorithms Oxford Lecture Series in Mathematics and Its Applications vol. 31 2006 Oxford University Press
18. R. Niedermeier Reflections on multivariate algorithmics and problem parameterization Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS'10) LIPIcs vol. 5 2010 Schloss Dagstuhl-Leibniz-Zentrum für Informatik 17 32