Improved bound for online square-into-square packing

DOI10.1007/978-3-319-18263-6_5MaRDI QIDQ3453282zbMATH OpenOpenAlexFDO

Authors Brian Brubach

Publication date 20 November 2015

Published in Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-18263-6_5

zbMATH Keywords

online problemspacking squarespacking rectangles

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Recommendations

• Online square and cube packing
• A new upper bound for the online square packing problem in a strip
• Online Square Packing

Cites work

• Improved bound for online square-into-square packing
• On packing squares into a rectangle
• On-line packing sequences of cubes in the unit cube
• Online removable square packing
• Some packing and covering theorems

Cited in

(12)

• Online removable square packing
• Split packing: algorithms for packing circles with optimal worst-case density
• Improved bound for online square-into-square packing
• An Improved Algorithm for Online Rectangle Filling
• Online packing of \(d\)-dimensional boxes into the unit cube
• On-line Packing Cubes into n Unit Cubes
• Approximation and online algorithms for multidimensional bin packing: a survey
• Online packing to minimize area or perimeter
• Packing batches of items into a single bin
• Packing batches of cubes into a single bin
• Online square and cube packing
• An efficient solution space exploring and descent method for packing equal spheres in a sphere

This page was built for publication: Improved bound for online square-into-square packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453282)