On computing Pareto optimal paths in weighted time-dependent networks

DOI10.1016/j.ipl.2020.106086OpenAlexW3119793544MaRDI QIDQ2656351

Pierluigi Crescenzi, Laurent Viennot, Filippo Brunelli

Publication date: 11 March 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.02086

zbMATH Keywords

graph algorithmstime-dependent networkminimum cost pathtemporal pathPareto optimal path

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (3)

Simple, strict, proper, happy: a study of reachability in temporal graphs ⋮ Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs ⋮ Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks

Cites Work

• Unnamed Item
• On the complexity of time-dependent shortest paths
• On a multicriteria shortest path problem
• On the enumeration of bicriteria temporal paths
• Shortest paths in time-dependent FIFO networks
• The shortest route through a network with time-dependent internodal transit times
• Intriguingly Simple and Fast Transit Routing
• Time-Dependent Route Planning with Generalized Objective Functions
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Minimum weight paths in time-dependent networks
• Connection Scan Algorithm
• An Appraisal of Some Shortest-Path Algorithms
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• An Introduction to Temporal Graphs: An Algorithmic Perspective^*

This page was built for publication: On computing Pareto optimal paths in weighted time-dependent networks