General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (Q429650)
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: General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems |
scientific article; zbMATH DE number 6048233
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems |
scientific article; zbMATH DE number 6048233 |
Statements
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (English)
0 references
20 June 2012
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
knapsack
0 references
minimum weighted perfect matching
0 references
0 references
0 references
0.9560495615005492
0 references
0.9251428842544556
0 references
0.9128220081329346
0 references
0.8317273259162903
0 references
