Packing squares independently

Given a set of squares and a strip with bounded width and infinite height, we consider a square strip packaging problem, which we call the square independent packing problem (SIPP), to minimize the strip height so that all the squares are packed into independent cells separated by horizontal and ver...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 1024; S. 114910
Hauptverfasser:	Wu, Wei, Numaguchi, Hiroki, Halman, Nir, Hu, Yannan, Yagiura, Mutsunori
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 12.01.2025
Schlagworte:	Complexity Dynamic programming Fully polynomial-time approximation scheme Strip packing 52C15 Fully polynomial-time approximation scheme Dynamic programming 05B40 Strip packing Complexity
ISSN:	0304-3975
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!