An Axiomatic Approach to Time-Dependent Shortest Path Oracles

Computing shortest paths in networks that exhibit a time-dependent metric is a core routine for many applications, with route planning in road networks being a prime example. In this work, we present an axiomatic approach which shows that for directed networks that satisfy certain properties we can...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 84; H. 3; S. 815 - 870
Hauptverfasser:	Kontogiannis, Spyros, Wagner, Dorothea, Zaroliagis, Christos
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.03.2022 Springer Nature B.V
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Networks Roads & highways Route planning Special Issue from London Stringology Days & London Algorithmic Workshop Theory of Computation Time dependence 68Q25 (analysis of algorithms and problem complexity) Distance oracles FIFO property Time-dependent shortest paths 05C85 (graph algorithms ) 05C12 (distance in graphs)
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!