Approximating Min-Max (Regret) Versions of Some Polynomial Problems (Q3591305): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:24, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating Min-Max (Regret) Versions of Some Polynomial Problems |
scientific article |
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
