The interval constrained 3-coloring problem

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

Volumn 6034 LNCS, Issue , 2010, Pages 591-602

  Byrka, Jaroslaw ^a   Karrenbauer, Andreas ^a   Sanità, Laura ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

3-COLORING PROBLEM; APX-HARDNESS; FIXED NUMBERS; NP COMPLETE; POLYNOMIAL-TIME;

COMPUTATIONAL COMPLEXITY; INFORMATION SCIENCE; POLYNOMIAL APPROXIMATION;

COLOR;

EID: 77953495962     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12200-2_51     Document Type: Conference Paper

References (9)

1. Lam, T., Lanman, J., Emmett, M., Hendrickson, C.,Marshall, A.G., Prevelige, P.:Mapping of protein:protein contact surfaces by hydrogen/deuterium exchange, followed by on-line highperformance liquid chromatography-electrospray ionization fourier-transform ion-cyclotronresonance mass analysis. Journal of Chromatography A 982(1), 85-95 (2002) (Pubitemid 35356413)
2. Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing 5(4), 691-703 (1976)
3. Althaus, E., Canzar, S., Emmett, M.R., Karrenbauer, A., Marshall, A.G., Meyer-Baese, A., Zhang, H.: Computing of H/D-Exchange Speeds of Single Residues form Data of Peptic Fragments. In: Proceedings of the 23rd Annual ACM Symposium on Applied Computing 2008, pp. 1273-1277 (2008)
4. 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)
5. Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding and its applications to approximation algorithms. J. ACM 53(3), 324-360 (2006) (Pubitemid 44180741)
6. Canzar, S.: Lagrangian Relaxation - Solving NP-hard problems in Computational Biology via Combinatorial Optimization. PhD thesis, Universität des Saarlandes (2008)
7. Komusiewicz, C., Niedermeier, R., Uhlmann, J.: Deconstructing Intractability - A Case Study for Interval Constrained Coloring. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009. LNCS, vol. 5577, pp. 207-220. Springer, Heidelberg (2009)
8. Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43(3), 425-440 (1991)
9. Dinur, I.: The pcp theorem by gap amplification. J. ACM 54(3), 12 (2007)