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

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1024; p. 114910
Main Authors:	Wu, Wei, Numaguchi, Hiroki, Halman, Nir, Hu, Yannan, Yagiura, Mutsunori
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 12.01.2025
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!