An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion (Q1183333)
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 -approximation scheme for combinatorial optimization problems with minimum variance criterion |
scientific article; zbMATH DE number 33079
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion |
scientific article; zbMATH DE number 33079 |
Statements
An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion (English)
0 references
28 June 1992
0 references
finding a feasible subset
0 references
polynomial time
0 references
fully polynomial time approximation
0 references
minimum variance problem
0 references
0 references
0 references
0.8392109870910645
0 references
0.8285310864448547
0 references
0.7465509176254272
0 references
0.740402102470398
0 references
