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...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 1024; s. 114910
Hlavní autori:	Wu, Wei, Numaguchi, Hiroki, Halman, Nir, Hu, Yannan, Yagiura, Mutsunori
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 12.01.2025
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!