Publikation:

Platform Assignment

Vorschaubild

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2007

Autor:innen

Di Stefano, Gabriele

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-118112
DOI (zitierfähiger Link)
https://doi.org/10.1007/978-3-540-74247-0_12
ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung

Sammlungen

Informatik und Informationswissenschaft: Publikationen
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

GERAETS, Frank, ed., Leo KROON, ed., Anita SCHOEBEL, ed., Dorothea WAGNER, ed., Christos D. ZAROLIAGIS, ed.. Algorithmic Methods for Railway Optimization. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 233-245. Lecture Notes in Computer Science. 4359. ISBN 978-3-540-74245-6. Available under: doi: 10.1007/978-3-540-74247-0_12

Zusammenfassung

We consider a station in which several trains might stop at the same platform at the same time. The trains might enter and leave the station to both sides, but the arrival and departure times and directions are fixed according to a given time table. The problem is to assign platforms to the trains such that they can enter and leave the station in time without being blocked by any other train. We consider some variation of the problem on linear time tables as well as on cyclic time tables and show how to solve them as a graph coloring problem on special graph classes. One of these classes are the so called circular arc containment graphs for which we give an O(n log n) coloring algorithm.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690CORNELSEN, Sabine, Gabriele DI STEFANO, 2007. Platform Assignment. In: GERAETS, Frank, ed., Leo KROON, ed., Anita SCHOEBEL, ed., Dorothea WAGNER, ed., Christos D. ZAROLIAGIS, ed.. Algorithmic Methods for Railway Optimization. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 233-245. Lecture Notes in Computer Science. 4359. ISBN 978-3-540-74245-6. Available under: doi: 10.1007/978-3-540-74247-0_12
BibTex
@inproceedings{Cornelsen2007Platf-3021,
  year={2007},
  doi={10.1007/978-3-540-74247-0_12},
  title={Platform Assignment},
  number={4359},
  isbn={978-3-540-74245-6},
  publisher={Springer Berlin Heidelberg},
  address={Berlin, Heidelberg},
  series={Lecture Notes in Computer Science},
  booktitle={Algorithmic Methods for Railway Optimization},
  pages={233--245},
  editor={Geraets, Frank and Kroon, Leo and Schoebel, Anita and Wagner, Dorothea and Zaroliagis, Christos D.},
  author={Cornelsen, Sabine and Di Stefano, Gabriele}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/3021">
    <dc:contributor>Cornelsen, Sabine</dc:contributor>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Di Stefano, Gabriele</dc:contributor>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:creator>Di Stefano, Gabriele</dc:creator>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T10:15:48Z</dcterms:available>
    <dc:language>eng</dc:language>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/3021"/>
    <dcterms:issued>2007</dcterms:issued>
    <dc:rights>terms-of-use</dc:rights>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T10:15:48Z</dc:date>
    <dc:creator>Cornelsen, Sabine</dc:creator>
    <dcterms:title>Platform Assignment</dcterms:title>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:abstract xml:lang="eng">We consider a station in which several trains might stop at the same platform at the same time. The trains might enter and leave the station to both sides, but the arrival and departure times and directions are fixed according to a given time table. The problem is to assign platforms to the trains such that they can enter and leave the station in time without being blocked by any other train. We consider some variation of the problem on linear time tables as well as on cyclic time tables and show how to solve them as a graph coloring problem on special graph classes. One of these classes are the so called circular arc containment graphs for which we give an O(n log n)  coloring algorithm.</dcterms:abstract>
    <dcterms:bibliographicCitation>Publ. in: Algorithmic Methods for Railway Optimization: International Dagstuhl Workshop, Railway Optimization 2004, Dagstuhl Castle, Germany, June 20 - 25, 2004; revised selected papers / Frank Geraets ... (eds.). Berlin, Heidelberg: Springer, 2007, pp. 233-245. - (= LNCS ; 4359)</dcterms:bibliographicCitation>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
Begutachtet
Diese Publikation teilen