Bin packing can be solved within 1+epsilon in linear time (Q1164429)
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: Bin packing can be solved within 1+epsilon in linear time |
scientific article; zbMATH DE number 3763308
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bin packing can be solved within 1+epsilon in linear time |
scientific article; zbMATH DE number 3763308 |
Statements
Bin packing can be solved within 1+epsilon in linear time (English)
0 references
1981
0 references
