Improved Bound for Online Square-into-Square Packing
From MaRDI portal
Publication:3453282
DOI10.1007/978-3-319-18263-6_5zbMath1410.68405OpenAlexW569389494MaRDI QIDQ3453282
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
Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Online algorithms; streaming algorithms (68W27)
Related Items (7)
Improved Bound for Online Square-into-Square Packing ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Packing batches of cubes into a single bin ⋮ On-line Packing Cubes into $n$ Unit Cubes ⋮ Online packing of \(d\)-dimensional boxes into the unit cube ⋮ Split packing: algorithms for packing circles with optimal worst-case density ⋮ Packing batches of items into a single bin
Cites Work
This page was built for publication: Improved Bound for Online Square-into-Square Packing
