Approximating the interval constrained coloring problem

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

Volumn 5124 LNCS, Issue , 2008, Pages 210-221

  Althaus, Ernst ^a   Canzar, Stefan ^a   Elbassioni, Khaled ^a   Karrenbauer, Andreas ^a   Mestre, Julián ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIOCHEMISTRY; BOOLEAN FUNCTIONS; COLOR; COLORING; DEUTERIUM; EXPERIMENTS; HYDROGEN; MASS SPECTROMETRY; NUCLEAR PROPULSION; OPTICAL PROPERTIES; POLYNOMIAL APPROXIMATION; TECHNICAL PRESENTATIONS;

APPROXIMATION SCHEMES; ARBITRARY NUMBERS; ASSEMBLY PROCESSES; COLORING PROBLEMS; DEUTERIUM EXCHANGES; EXCHANGE RATES; EXPERIMENTAL DATUM; MASS SPECTROSCOPIES; MATHEMATICAL ABSTRACTIONS; POLYHEDRAL THEORIES; PROTEIN BACKBONES; PROTEIN RESIDUES; PROTEIN SEGMENTS; PROTEIN STRUCTURES; PROTEIN TERTIARY STRUCTURES; RANDOMIZED ROUNDING;

SET THEORY;

EID: 54249145764     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69903-3_20     Document Type: Conference Paper

References (6)

1. Althaus, E., Canzar, S., Emmett, M.R., Karrenbauer, A., Marshall, A.G., Meyer-Basese, A., Zhang, H.: Computing H/D-exchange speeds of single residues from data of peptic fragments. In: 23rd Annual ACM Symposium on Applied Computing (2008)
2. Chang, J., Erlebach, T., Gailis, R., Khuller, S.: Broadcast scheduling: Algorithms and complexity. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (2008)
3. Elbassioni, K.M., Sitters, R., Zhang, Y.: A quasi-PTAS for profit-maximizing pricing on line graphs. In: Proceedings of the 15th Annual European Symposium on Algorithms, pp. 451-462 (2007)
4. Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding and its applications to approximation algorithms. J. ACM 53(3), 324-360 (2006)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, New York (1979)
6. Uno, T.: A fast algorithm for enumerating bipartite perfect matchings. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 367-379. Springer, Heidelberg (2001)