| Full text | |
| Author(s): |
Miyazawa, Flavio K.
;
Wakabayashi, Yoshiko
Total Authors: 2
|
| Document type: | Journal article |
| Source: | SAO PAULO JOURNAL OF MATHEMATICAL SCIENCES; v. 16, n. 1, p. 31-pg., 2022-04-11. |
| Abstract | |
This survey provides an introductory guide to some techniques used in the design of approximation algorithms for circle packing problems. We address three such packing problems, in which the circles may have different sizes. They differ on the type of the recipient. We consider the classical bin packing and strip packing, and a variant called knapsack packing. Our aim is to discuss some techniques and basic algorithms to motivate the reader to investigate these and other related problems. We also present the ideas used on more elaborated algorithms, without going into details, and mention known results on these problems. (AU) | |
| FAPESP's process: | 15/11937-9 - Investigation of hard problems from the algorithmic and structural stand points |
| Grantee: | Flávio Keidi Miyazawa |
| Support Opportunities: | Research Projects - Thematic Grants |
| FAPESP's process: | 16/01860-1 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings |
| Grantee: | Reinaldo Morabito Neto |
| Support Opportunities: | Research Projects - Thematic Grants |