An improved FPTAS for Restricted Shortest Path. (Q1853085): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for the Restricted Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The network inhibition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems / rank
 
Normal rank

Revision as of 11:22, 5 June 2024

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
    Approximation algorithms
    0 references
    Combinatorial problems
    0 references
    Shortest path
    0 references
    Acyclic graphs
    0 references

    Identifiers