On the complexity of time-dependent shortest paths (Q476455): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: J. E. Hershberger / rank
Normal rank
 
Property / author
 
Property / author: Subhash Suri / rank
Normal rank
 
Property / author
 
Property / author: J. E. Hershberger / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-012-9714-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3043093646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501855 / 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: Time-varying shortest path problems with constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time depending shortest-path problems with applications to railway networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / 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 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: Q5417668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Problems on Graphs of Bounded Tree-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4499944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3895490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric shortest path algorithms with an application to cyclic staffing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted region problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidirectional A  ∗  Search for Time-Dependent Fast Paths / 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: 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: Worst-case update times for fully-dynamic all-pairs shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster parametric shortest path and minimum‐balance algorithms / rank
 
Normal rank

Latest revision as of 08:42, 9 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of time-dependent shortest paths
scientific article

    Statements

    On the complexity of time-dependent shortest paths (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 December 2014
    0 references
    time-dependent shortest path
    0 references
    piecewise linear delay functions
    0 references
    parametric shortest path
    0 references
    approximation algorithms
    0 references

    Identifiers

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