On the complexity of time-dependent shortest paths (Q476455)

From MaRDI portal
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
    0 references
    0 references
    0 references
    0 references
    0 references
    time-dependent shortest path
    0 references
    piecewise linear delay functions
    0 references
    parametric shortest path
    0 references
    approximation algorithms
    0 references
    0 references