An improved FPTAS for Restricted Shortest Path. (Q1853085)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An improved FPTAS for Restricted Shortest Path. |
scientific article; zbMATH DE number 1856422
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved FPTAS for Restricted Shortest Path. |
scientific article; zbMATH DE number 1856422 |
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
0.8676660656929016
0 references
0.86725914478302
0 references
0.847471296787262
0 references
0.8185335993766785
0 references
0.8097566366195679
0 references
