License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2021.7
URN: urn:nbn:de:0030-drops-148767
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/14876/
Lindner, Niels ;
Maristany de las Casas, Pedro ;
Schiewe, Philine
Optimal Forks: Preprocessing Single-Source Shortest Path Instances with Interval Data
Abstract
We investigate preprocessing for single-source shortest path queries in digraphs, where arc costs are only known to lie in an interval. More precisely, we want to decide for each arc whether it is part of some shortest path tree for some realization of costs. We show that this problem is solvable in polynomial time by giving a combinatorial algorithm, using optimal structures that we call forks. Our algorithm turns out to be very efficient in practice, and is sometimes even superior in quality to a heuristic developed for the one-to-one shortest path problem in the context of passenger routing in public transport.
BibTeX - Entry
@InProceedings{lindner_et_al:OASIcs.ATMOS.2021.7,
author = {Lindner, Niels and Maristany de las Casas, Pedro and Schiewe, Philine},
title = {{Optimal Forks: Preprocessing Single-Source Shortest Path Instances with Interval Data}},
booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
pages = {7:1--7:15},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-213-6},
ISSN = {2190-6807},
year = {2021},
volume = {96},
editor = {M\"{u}ller-Hannemann, Matthias and Perea, Federico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14876},
URN = {urn:nbn:de:0030-drops-148767},
doi = {10.4230/OASIcs.ATMOS.2021.7},
annote = {Keywords: Preprocessing Shortest Path Problems, Interval Data, Graph Algorithms}
}
