An improved FPTAS for Restricted Shortest Path. (Q1853085)

From MaRDI portal
Revision as of 11:27, 28 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An improved FPTAS for Restricted Shortest Path.
scientific article

    Statements

    An improved FPTAS for Restricted Shortest Path. (English)
    0 references
    0 references
    0 references
    0 references
    21 January 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    Approximation algorithms
    0 references
    Combinatorial problems
    0 references
    Shortest path
    0 references
    Acyclic graphs
    0 references