An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion (Q1183333)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion |
scientific article |
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
