Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items

In Two-dimensional Bin Packing ( 2BP ), we are given n rectangles as input and our goal is to find an axis-aligned nonoverlapping packing of these rectangles into the minimum number of unit square bins. 2BP admits no APTAS and the current best approximation ratio is 1.406 by Bansal and Khan (ACM-SIA...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica Jg. 85; H. 9; S. 2735 - 2778
Hauptverfasser:	Khan, Arindam, Sharma, Eklavya
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.09.2023 Springer Nature B.V
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Approximation Bins Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematical analysis Mathematics of Computing Rectangles Theory of Computation Guillotine cuts Approximation algorithms Geometric bin packing
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!