Generating Node Coordinates for Shortest-Path Computations in Transportation Networks

Kurzanzeige
dc.contributor.authorBrandes, Ulrik
dc.contributor.authorSchulz, Frankdeu
dc.contributor.authorWagner, Dorotheadeu
dc.contributor.authorWillhalm, Thomasdeu
dc.date.accessioned2011-03-24T16:01:29Zdeu
dc.date.available2011-03-24T16:01:29Zdeu
dc.date.issued2004deu
dc.description.abstractSpeed-up techniques that exploit given node coordinates have proven useful for shortest-path computations in transportation networks and geographic information systems. To facilitate the use of such techniques when coordinates are missing from some, or even all, of the nodes in a network we generate artificial coordinates using methods from graph drawing. Experiments on a large set of German train timetables indicate that the speed-up achieved with coordinates from our drawings is close to that achieved with the true coordinates and in some special cases even better.eng
dc.description.versionpublished
dc.format.mimetypeapplication/pdfdeu
dc.identifier.citationFirst publ. in: Journal of Experimental Algorithmics 9 (2004), Article 1.1deu
dc.identifier.doi10.1145/1005813.1005815
dc.identifier.ppn302576010deu
dc.identifier.urihttp://kops.uni-konstanz.de/handle/123456789/5937
dc.language.isoengdeu
dc.legacy.dateIssued2009deu
dc.rightsAttribution-NonCommercial-NoDerivs 2.0 Generic
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/2.0/
dc.subjectgraph drawingdeu
dc.subjectshortest pathsdeu
dc.subjecttransportation networksdeu
dc.subjecttravel planningdeu
dc.subject.ddc004deu
dc.titleGenerating Node Coordinates for Shortest-Path Computations in Transportation Networkseng
dc.typeJOURNAL_ARTICLEdeu
dspace.entity.typePublication
kops.citation.bibtex
@article{Brandes2004Gener-5937,
  year={2004},
  doi={10.1145/1005813.1005815},
  title={Generating Node Coordinates for Shortest-Path Computations in Transportation Networks},
  volume={9},
  journal={Journal of Experimental Algorithmics},
  author={Brandes, Ulrik and Schulz, Frank and Wagner, Dorothea and Willhalm, Thomas},
  note={Article Number: 1.1}
}
kops.citation.iso690BRANDES, Ulrik, Frank SCHULZ, Dorothea WAGNER, Thomas WILLHALM, 2004. Generating Node Coordinates for Shortest-Path Computations in Transportation Networks. In: Journal of Experimental Algorithmics. 2004, 9, 1.1. Available under: doi: 10.1145/1005813.1005815deu
kops.citation.iso690BRANDES, Ulrik, Frank SCHULZ, Dorothea WAGNER, Thomas WILLHALM, 2004. Generating Node Coordinates for Shortest-Path Computations in Transportation Networks. In: Journal of Experimental Algorithmics. 2004, 9, 1.1. Available under: doi: 10.1145/1005813.1005815eng
kops.citation.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/5937">
    <dc:creator>Brandes, Ulrik</dc:creator>
    <dc:language>eng</dc:language>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5937/1/transportation.pdf"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:01:29Z</dc:date>
    <dcterms:abstract xml:lang="eng">Speed-up techniques that exploit given node coordinates have proven useful for shortest-path computations in transportation networks and geographic information systems. To facilitate the use of such techniques when coordinates are missing from some, or even all, of the nodes in a network we generate artificial coordinates using methods from graph drawing. Experiments on a large set of German train timetables indicate that the speed-up achieved with coordinates from our drawings is close to that achieved with the true coordinates and in some special cases even better.</dcterms:abstract>
    <dcterms:issued>2004</dcterms:issued>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <dc:creator>Wagner, Dorothea</dc:creator>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5937/1/transportation.pdf"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Willhalm, Thomas</dc:contributor>
    <dc:creator>Willhalm, Thomas</dc:creator>
    <dc:creator>Schulz, Frank</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:bibliographicCitation>First publ. in: Journal of Experimental Algorithmics 9 (2004), Article 1.1</dcterms:bibliographicCitation>
    <dc:contributor>Wagner, Dorothea</dc:contributor>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5937"/>
    <dc:format>application/pdf</dc:format>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:01:29Z</dcterms:available>
    <dcterms:title>Generating Node Coordinates for Shortest-Path Computations in Transportation Networks</dcterms:title>
    <dc:contributor>Schulz, Frank</dc:contributor>
  </rdf:Description>
</rdf:RDF>
kops.description.openAccessopenaccessgreen
kops.flag.knbibliographytrue
kops.identifier.nbnurn:nbn:de:bsz:352-opus-72120deu
kops.opus.id7212deu
kops.sourcefieldJournal of Experimental Algorithmics. 2004, <b>9</b>, 1.1. Available under: doi: 10.1145/1005813.1005815deu
kops.sourcefield.plainJournal of Experimental Algorithmics. 2004, 9, 1.1. Available under: doi: 10.1145/1005813.1005815deu
kops.sourcefield.plainJournal of Experimental Algorithmics. 2004, 9, 1.1. Available under: doi: 10.1145/1005813.1005815eng
relation.isAuthorOfPublicationfa1660c9-a071-4d01-9bdd-7adcd0e2d7d7
relation.isAuthorOfPublication.latestForDiscoveryfa1660c9-a071-4d01-9bdd-7adcd0e2d7d7
source.bibliographicInfo.articleNumber1.1
source.bibliographicInfo.volume9
source.periodicalTitleJournal of Experimental Algorithmics

Dateien

Originalbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
transportation.pdf
Größe:
594.23 KB
Format:
Adobe Portable Document Format
transportation.pdf
transportation.pdfGröße: 594.23 KBDownloads: 621

Sammlungen

Informatik und Informationswissenschaft: Publikationen