Collective Shortest Paths for Minimizing Congestion on Temporal Load-Aware Road Networks

Shortest path queries over graphs are usually considered as isolated tasks, where the goal is to return the shortest path for each individual query. In practice, however, such queries are typically part of a system (e.g., a road network) and their execution dynamically affects other queries and netw...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2021-10
Hauptverfasser:	Conlan, Chris, Cunningham, Teddy, Demirci, Gunduz Vehbi, Ferhatosmanoglu, Hakan
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Computer Science - Data Structures and Algorithms Computer Science - Databases Congestion Graphs Load Queries Query processing Roads Shortest-path problems Tracks (paths) Transportation networks Travel time
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!