Online Square Packing

DOI10.1007/978-3-642-03367-4_27zbMath1253.68369arXiv1010.4502OpenAlexW1495357083MaRDI QIDQ3183464

Nils Schweer, Tom Kamphans, Sándor P. Fekete

Publication date: 20 October 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.4502

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)

Related Items (3)

Online square packing with gravity ⋮ Online square-into-square packing ⋮ Two Dimensional Strip Packing with Unloading Constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Shelf algorithms for on-line strip packing
• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• An improved lower bound for on-line bin packing algorithms
• Packing rectangles in a strip
• Orthogonal Packings in Two Dimensions
• On Two Dimensional Packing
• TETRIS IS HARD, EVEN TO APPROXIMATE
• New classes of fast lower bounds for bin packing problems

This page was built for publication: Online Square Packing