Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths (Q3593366)

From MaRDI portal
Revision as of 11:37, 26 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
scientific article

    Statements

    Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths (English)
    0 references
    0 references
    0 references
    20 July 2007
    0 references
    inverse shortest paths
    0 references
    computational complexity
    0 references
    approximation algorithms
    0 references
    shortest path routing
    0 references
    0 references
    0 references

    Identifiers

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