Distance oracles for time-dependent networks (Q289929): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
aliases / en / 0aliases / en / 0
 
Distance Oracles for Time-Dependent Networks
description / endescription / en
scientific article
scientific article; zbMATH DE number 6312249
Property / title
 
Distance Oracles for Time-Dependent Networks (English)
Property / title: Distance Oracles for Time-Dependent Networks (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1410.68301 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-662-43948-7_59 / rank
 
Normal rank
Property / published in
 
Property / published in: Automata, Languages, and Programming / rank
 
Normal rank
Property / publication date
 
1 July 2014
Timestamp+2014-07-01T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 1 July 2014 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6312249 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2567835753 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1309.4973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Space-Stretch-Time Tradeoff in Distance Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance Oracles for Stretch Less Than 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path queries in static networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum time-dependent travel times with contraction hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Stochastic Shortest Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest route through a network with time-dependent internodal transit times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidirectional A* search on time-dependent road networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for minimum-cost paths in time-dependent networks with waiting policies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in time-dependent FIFO networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-dependent SHARC-routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Dependent Route Planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Appraisal of Some Shortest-Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of time-dependent shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3895490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity and inference problems for temporal networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance oracles for time-dependent networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal Network Optimization Subject to Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Shortest Paths Via Quasi-convex Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance Oracles beyond the Thorup--Zwick Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocess, Set, Query! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
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: Distance Oracles for Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case update times for fully-dynamic all-pairs shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743389 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Distance Oracles for Planar Graphs with Improved Query Time-Space Tradeoff / rank
 
Normal rank

Latest revision as of 02:50, 12 July 2024

scientific article; zbMATH DE number 6312249
  • Distance Oracles for Time-Dependent Networks
Language Label Description Also known as
English
Distance oracles for time-dependent networks
scientific article; zbMATH DE number 6312249
  • Distance Oracles for Time-Dependent Networks

Statements

Distance oracles for time-dependent networks (English)
0 references
Distance Oracles for Time-Dependent Networks (English)
0 references
31 May 2016
0 references
1 July 2014
0 references
time-dependent shortest paths
0 references
FIFO property
0 references
distance oracles
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references