\(\varepsilon\)-approximation schemes for the constrained shortest path problem (Q4635995)
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: -approximation schemes for the constrained shortest path problem |
scientific article; zbMATH DE number 6863610
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(\varepsilon\)-approximation schemes for the constrained shortest path problem |
scientific article; zbMATH DE number 6863610 |
Statements
23 April 2018
0 references
fully polynomial time approximation algorithm
0 references
Hassin-Lorenz-Raz (HLR) algorithm
0 references
0.8387933969497681
0 references
0.8384562730789185
0 references
0.7985066175460815
0 references
0.7607266902923584
0 references
