KOPS - The Institutional Repository of the University of Konstanz
# Approximating the Interval Constrained Coloring Problem

Type of Publication: | Contribution to a conference |

URI (citable link): | http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-121999 |

Author: | Althaus, Ernst; Canzar, Stefan; Elbassioni, Khaled; Karrenbauer, Andreas; Mestre, Julián |

Year of publication: | 2008 |

Published in: | Algorithm Theory – SWAT 2008 / Gudmundsson, Joachim (ed.). - Berlin, Heidelberg : Springer Berlin Heidelberg, 2008. - (Lecture Notes in Computer Science). - pp. 210-221. - ISSN 0302-9743. - eISSN 1611-3349. - ISBN 978-3-540-69900-2 |

DOI (citable link): | https://dx.doi.org/10.1007/978-3-540-69903-3_20 |

Summary: |
We consider the interval constrained coloring problem, which appears in the interpretation of experimental data in biochemistry. Monitoring hydrogen-deuterium exchange rates via mass spectroscopy experiments is a method used to obtain information about protein tertiary structure. The output of these experiments provides data about the exchange rate of residues in overlapping segments of the protein backbone. These segments must be re-assembled in order to obtain a global picture of the protein structure. The interval constrained coloring problem is the mathematical abstraction of this re-assembly process. The objective of the interval constrained coloring problem is to assign a color (exchange rate) to a set of integers (protein residues) such that a set of constraints is satisfied. Each constraint is made up of a closed interval (protein segment) and requirements on the number of elements that belong to each color class (exchange rates observed in the experiments).
We show that the problem is NP-complete for arbitrary number of colors and we provide algorithms that given a feasible instance find a coloring that satisfies all the coloring requirements within ±1 of the prescribed value. In light of our first result, this is essentially the best one can hope for. Our approach is based on polyhedral theory and randomized rounding techniques. Furthermore, we develop a quasi-polynomial-time approximation scheme for a variant of our problem where we are asked to find a coloring satisfying as many fragments as possible. |

Subject (DDC): | 004 Computer Science |

Link to License: | Terms of use |

Checksum:
MD5:6d729ed873cfb311df65ba8de84586a7

ALTHAUS, Ernst, Stefan CANZAR, Khaled ELBASSIONI, Andreas KARRENBAUER, Julián MESTRE, 2008. Approximating the Interval Constrained Coloring Problem. In: GUDMUNDSSON, Joachim, ed.. Algorithm Theory – SWAT 2008. Berlin, Heidelberg:Springer Berlin Heidelberg, pp. 210-221. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-540-69900-2. Available under: doi: 10.1007/978-3-540-69903-3_20

@inproceedings{Althaus2008Appro-6068, title={Approximating the Interval Constrained Coloring Problem}, year={2008}, doi={10.1007/978-3-540-69903-3_20}, isbn={978-3-540-69900-2}, issn={0302-9743}, address={Berlin, Heidelberg}, publisher={Springer Berlin Heidelberg}, series={Lecture Notes in Computer Science}, booktitle={Algorithm Theory – SWAT 2008}, pages={210--221}, editor={Gudmundsson, Joachim}, author={Althaus, Ernst and Canzar, Stefan and Elbassioni, Khaled and Karrenbauer, Andreas and Mestre, Julián} }

Karrenbauer etal.pdf | 217 |