Online Bin Packing of Squares and Cubes

In the d -dimensional online bin packing problem, d -dimensional cubes of positive sizes no larger than 1 are presented one by one to be assigned to positions in d -dimensional unit cube bins. In this work, we provide improved upper bounds on the asymptotic competitive ratio for square and cube bin...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica 2023-05, Vol.85 (5), p.1415-1458
Hauptverfasser:	Epstein, Leah, Mualem, Loay
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Cubes Data Structures and Information Theory Mathematics of Computing Operations research Theory of Computation Upper bounds Weighting functions
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!