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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Funda Ergün / rank
Normal rank
 
Property / author
 
Property / author: Q1853084 / rank
Normal rank
 
Property / author
 
Property / author: Funda Ergün / rank
 
Normal rank
Property / author
 
Property / author: Rakesh Kumar Sinha / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(02)00205-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061701207 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:57, 30 July 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
    0 references
    0 references
    0 references
    0 references
    Approximation algorithms
    0 references
    Combinatorial problems
    0 references
    Shortest path
    0 references
    Acyclic graphs
    0 references
    0 references