Optimal Forks: Preprocessing Single-Source Shortest Path Instances with Interval Data

Please always quote using this URN: urn:nbn:de:0297-zib-82716
accepted for publication
  • 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.

Download full text files

Export metadata

Author:Niels LindnerORCiD, Pedro Maristany de las CasasORCiD, Philine SchieweORCiD
Document Type:ZIB-Report
Tag:Graph Algorithms; Interval Data; Preprocessing Shortest Path Problems
CCS-Classification:G. Mathematics of Computing
J. Computer Applications
Date of first Publication:2021/06/29
Series (Serial Number):ZIB-Report (21-17)