An asymptotic fully polynomial time approximation scheme for bin covering. (Q1426473): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:45, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An asymptotic fully polynomial time approximation scheme for bin covering. |
scientific article |
Statements
An asymptotic fully polynomial time approximation scheme for bin covering. (English)
0 references
14 March 2004
0 references
Asymptotic approximation scheme
0 references
Bin covering
0 references
Linear programming
0 references
