OPTIMAL ROUTING BY LANDMARKS IN THE TIME-DEPENDENT NETWORKS

DOI10.17223/20710410/37/10MaRDI QIDQ5151077zbMATH OpenOpenAlexFDO

Authors Valentina Vladimirovna Bykova, Aleksandr A. Soldatenko

Publication date 16 February 2021

Published in Prikladnaya diskretnaya matematika (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/pdm589

zbMATH Keywords

correctness of ALT algorithmoptimal routingtime-dependent network

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites work

• Computing the shortest path: A^ search meets graph theory
• Speed-Up Techniques for Shortest-Path Computations
• The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
• Time-dependent SHARC-routing

Describes a project that uses

Uses Software

• DIMACS

This page was built for publication: OPTIMAL ROUTING BY LANDMARKS IN THE TIME-DEPENDENT NETWORKS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5151077)