Approximating Min-Max (Regret) Versions of Some Polynomial Problems (Q3591305)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5189487
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating Min-Max (Regret) Versions of Some Polynomial Problems |
scientific article; zbMATH DE number 5189487 |
Statements
Approximating Min-Max (Regret) Versions of Some Polynomial Problems (English)
0 references
10 September 2007
0 references
min-max
0 references
min-max regret
0 references
approximation
0 references
fptas
0 references
shortest path
0 references
minimum spanning tree
0 references
0.9560495615005492
0 references
0.9478668570518494
0 references
0.9236854314804076
0 references
0.8648999929428101
0 references
