Bin packing can be solved within 1+epsilon in linear time (Q1164429): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q56212224, #quickstatements; #temporary_batch_1707252663060 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56212224 / rank | |||
Normal rank | |||
Revision as of 23:18, 6 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bin packing can be solved within 1+epsilon in linear time |
scientific article |
Statements
Bin packing can be solved within 1+epsilon in linear time (English)
0 references
1981
0 references
