A 13/12 approximation algorithm for bin packing with extendable bins (Q293250): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Paolo Dell'Olmo / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6590694 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
bin packing | |||
| Property / zbMATH Keywords: bin packing / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
scheduling | |||
| Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
approximation algorithms | |||
| Property / zbMATH Keywords: approximation algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
worst-case performance | |||
| Property / zbMATH Keywords: worst-case performance / rank | |||
Normal rank | |||
Revision as of 21:16, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 13/12 approximation algorithm for bin packing with extendable bins |
scientific article |
Statements
A 13/12 approximation algorithm for bin packing with extendable bins (English)
0 references
9 June 2016
0 references
bin packing
0 references
scheduling
0 references
approximation algorithms
0 references
worst-case performance
0 references
