Deconstructing intractability: A case study for interval constrained coloring

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5577 LNCS, Issue , 2009, Pages 207-220

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

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMICS; COLORING PROBLEMS; COMBINATORIAL RESEARCH; EXPERIMENTAL DATA; INTEGER POINT; MULTI-SETS; NP-HARD; NP-HARDNESS; PROTEIN FRAGMENTS; RANDOMIZED ROUNDING METHOD;

BIOCHEMISTRY; COLOR; COMPUTATIONAL COMPLEXITY; PATTERN MATCHING; PHASE MODULATION;

COLORING;

EID: 70349389881     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02441-2_19     Document Type: Conference Paper

References (9)

1. Althaus, E., Canzar, S., Elbassioni, K., Karrenbauer, A., Mestre, J.: Approximating the interval constrained coloring problem. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol. 5124, pp. 210-221. Springer, Heidelberg (2008)
2. Althaus, E., Canzar, S., Emmett, M.R., Karrenbauer, A., Marshall, A.G., Meyer-Baese, A., Zhang, H.: Computing H/D-exchange speeds of single residues from data of peptic fragments. In: Proceedings of the 23rd ACM Symposium on Applied Computing (SAC 2008), pp. 1273-1277. ACM Press, New York (2008)
3. n). Journal of Algorithms 54(2), 168-204 (2005)
4. Chang, J., Erlebach, T., Gailis, R., Khuller, S.: Broadcast scheduling: Algorithms and complexity. In: Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 473-482. ACM-SIAM (2008)
5. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
6. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
7. Lenstra, H.W.: Integer programming with a fixed number of variables. Mathematics of Operations 8, 538-548 (1983)
8. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications, vol. 31. Oxford University Press, Oxford (2006)
9. Woeginger, G.J.: Exact algorithms for NP-hard problems: A survey. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol. 2570, pp. 185-208. Springer, Heidelberg (2003)