KOPS - Das Institutionelle Repositorium der Universität Konstanz

Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap

Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:c2c021d315897b95ae935cbe39bf5f5e

CHONDROGIANNIS, Theodoros, Panagiotis BOUROS, Johann GAMPER, Ulf LESER, 2017. Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap. 20th International Conference on Extending Database Technology : EDBT 2017. Venice, Italy, 21. Mär 2017 - 24. Mär 2017. In: MARKL, Volker, ed. and others. Advances in Database Technology EDBT 2017 : 20th International Conference on Extending Database Technology ; Proceedings. 20th International Conference on Extending Database Technology : EDBT 2017. Venice, Italy, 21. Mär 2017 - 24. Mär 2017. Konstanz:OpenProceedings.org, pp. 414-425. eISSN 2367-2005. ISBN 978-3-89318-073-8. Available under: doi: 10.5441/002/edbt.2017.37

@inproceedings{Chondrogiannis2017Exact-41127, title={Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap}, url={https://openproceedings.org/2017/conf/edbt/paper-32.pdf}, year={2017}, doi={10.5441/002/edbt.2017.37}, isbn={978-3-89318-073-8}, address={Konstanz}, publisher={OpenProceedings.org}, booktitle={Advances in Database Technology EDBT 2017 : 20th International Conference on Extending Database Technology ; Proceedings}, pages={414--425}, editor={Markl, Volker}, author={Chondrogiannis, Theodoros and Bouros, Panagiotis and Gamper, Johann and Leser, Ulf} }

<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/rdf/resource/123456789/41127"> <dcterms:issued>2017</dcterms:issued> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:rights>terms-of-use</dc:rights> <dc:creator>Bouros, Panagiotis</dc:creator> <dcterms:rights rdf:resource="https://kops.uni-konstanz.de/page/termsofuse"/> <dcterms:title>Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap</dcterms:title> <dc:contributor>Leser, Ulf</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-01-24T10:08:54Z</dc:date> <dc:contributor>Bouros, Panagiotis</dc:contributor> <dc:creator>Leser, Ulf</dc:creator> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/41127"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Chondrogiannis, Theodoros</dc:contributor> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/41127/3/Chondrogiannis_2-1g7olmzoe6uji7.pdf"/> <dc:creator>Gamper, Johann</dc:creator> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/41127/3/Chondrogiannis_2-1g7olmzoe6uji7.pdf"/> <dc:contributor>Gamper, Johann</dc:contributor> <dc:language>eng</dc:language> <dc:creator>Chondrogiannis, Theodoros</dc:creator> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-01-24T10:08:54Z</dcterms:available> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 24.01.2018 (Informationen über die Zugriffsstatistik)

Chondrogiannis_2-1g7olmzoe6uji7.pdf 35

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto