Approximation algorithms for the bin packing problem
The Bin Packing Problem is a classical NP-hard problem. This study gathers the proofs of the approximation ratios for several known approximation algorithms for this problem, including Next-Fit, First-Fit, and two approximation schemes. It also considers the inapproximability of the Bin Packing Prob...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Online |
| Language: | Portuguese |
| Published: |
Universidade Estadual de Campinas
2019
|
| Subjects: | |
| Online Access: | https://econtents.sbu.unicamp.br/eventos/index.php/pibic/article/view/1943 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The Bin Packing Problem is a classical NP-hard problem. This study gathers the proofs of the approximation ratios for several known approximation algorithms for this problem, including Next-Fit, First-Fit, and two approximation schemes. It also considers the inapproximability of the Bin Packing Problem by ratios lower than 1.5, and lower bounds for the competitive ratios of online algorithms, bounded-space and otherwise. |
|---|---|
| ISSN: | 2596-1969 |
