An improved FPTAS for Restricted Shortest Path. (Q1853085): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 12:10, 1 February 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
21 January 2003
0 references
Approximation algorithms
0 references
Combinatorial problems
0 references
Shortest path
0 references
Acyclic graphs
0 references