The Interval Constrained 3-Coloring Problem

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:8a7869d04ec6095d66fe2ecf47202fb3

BYRKA, Jaroslaw, Andreas KARRENBAUER, Laura SANITÀ, 2010. The Interval Constrained 3-Coloring Problem. LATIN 2010 : Theoretical Informatics ; 9th Latin American Symposium. Oaxaca, Mexico, 19. Apr 2010 - 23. Apr 2010. In: LÓPEZ-ORTIZ, Alejandro, ed.. LATIN 2010 : Theoretical Informatics ; Proceedings. LATIN 2010 : Theoretical Informatics ; 9th Latin American Symposium. Oaxaca, Mexico, 19. Apr 2010 - 23. Apr 2010. Berlin:Springer, pp. 591-602. ISSN 0302-9743. ISBN 978-3-642-12199-9

@inproceedings{Byrka2010Inter-6232, title={The Interval Constrained 3-Coloring Problem}, year={2010}, doi={10.1007/978-3-642-12200-2_51}, number={6034}, isbn={978-3-642-12199-9}, issn={0302-9743}, address={Berlin}, publisher={Springer}, series={Lecture Notes in Computer Science}, booktitle={LATIN 2010 : Theoretical Informatics ; Proceedings}, pages={591--602}, editor={López-Ortiz, Alejandro}, author={Byrka, Jaroslaw and Karrenbauer, Andreas and Sanità, Laura} }

<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/6232"> <dcterms:bibliographicCitation>First publ. in: arXiv:0907.3563v2 [cs.DM]</dcterms:bibliographicCitation> <dcterms:abstract xml:lang="eng">In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if the number of different colors is 3. Previously, it has only been known that it is NP-complete, if the number of colors is part of the input and that the problem is solvable in polynomial time, if the number of colors is at most 2. We also show that it is hard to satisfy almost all of the constraints for a feasible instance. This implies APX-hardness of maximizing the number of simultaneously satisfiable intervals.</dcterms:abstract> <dc:contributor>Byrka, Jaroslaw</dc:contributor> <dc:rights>deposit-license</dc:rights> <dc:creator>Sanità, Laura</dc:creator> <dc:format>application/pdf</dc:format> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:10:24Z</dcterms:available> <dcterms:issued>2010</dcterms:issued> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:10:24Z</dc:date> <dc:creator>Karrenbauer, Andreas</dc:creator> <dc:contributor>Sanità, Laura</dc:contributor> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103416863-3868037-7"/> <dcterms:title>The Interval Constrained 3-Coloring Problem</dcterms:title> <dc:contributor>Karrenbauer, Andreas</dc:contributor> <dc:creator>Byrka, Jaroslaw</dc:creator> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6232"/> <dc:language>eng</dc:language> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

0907.3563v2.pdf 93

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto