OPTIMAL ROUTING BY LANDMARKS IN THE TIME-DEPENDENT NETWORKS (Q5151077): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Speed-Up Techniques for Shortest-Path Computations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2921666 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Time-dependent SHARC-routing / rank | |||
Normal rank | |||
Latest revision as of 14:20, 24 July 2024
scientific article; zbMATH DE number 7311437
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | OPTIMAL ROUTING BY LANDMARKS IN THE TIME-DEPENDENT NETWORKS |
scientific article; zbMATH DE number 7311437 |
Statements
OPTIMAL ROUTING BY LANDMARKS IN THE TIME-DEPENDENT NETWORKS (English)
0 references
16 February 2021
0 references
time-dependent network
0 references
optimal routing
0 references
correctness of ALT algorithm
0 references
0 references
