Online square and cube packing

DOI10.1007/S00236-005-0169-ZMaRDI QIDQ2570973zbMATH OpenOpenAlexFDO

Authors Leah Epstein, Rob Stee

Publication date 31 October 2005

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-005-0169-z

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Analysis of algorithms (68W40)

Recommendations

• Improved Online Hypercube Packing
• Bounds for online bounded space hypercube packing
• A note on online hypercube packing
• Improved bound for online square-into-square packing
• 2-space bounded online cube and hypercube packing

Cites work

• A lower bound for on-line bin packing
• A simple on-line bin-packing algorithm
• Algorithms – ESA 2004
• An improved lower bound for on-line bin packing algorithms
• Cube packing.
• Fast algorithms for bin packing
• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• New Algorithms for Bin Packing
• New bounds for multidimensional packing
• On the online bin packing problem
• On-line bin packing in linear time
• Optimal online bounded space multidimensional packing
• Toeplitz Matrices Associated with a Semi-Infinite Laurent Series
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

Cited in

(29)

• On-line grid-packing with a single active grid
• New bounds for multidimensional packing
• Cube packing.
• A new upper bound for the online square packing problem in a strip
• Packing batches of items into a single bin
• A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game
• A lower bound for online rectangle packing
• Packing cubes into a cube is NP-complete in the strong sense
• Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
• Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
• Approximation and online algorithms for multidimensional bin packing: a survey
• Online circle and sphere packing
• On-line Packing Cubes into n Unit Cubes
• One-space bounded algorithms for two-dimensional bin packing
• Online Square Packing
• Packing cubes into a cube in \((D>3)\)-dimensions
• Improved bound for online square-into-square packing
• On-line algorithms for 2-space bounded 2-dimensional bin packing
• Online square packing with gravity
• scientific article; zbMATH DE number 2098192 (Why is no real title available?)
• scientific article; zbMATH DE number 2119702 (Why is no real title available?)
• Improved Online Hypercube Packing
• Online bin packing of squares and cubes
• Approximation and Online Algorithms
• Online bin packing of squares and cubes
• Dynamic multi-dimensional bin packing
• A note on online hypercube packing
• Online removable square packing
• Two-dimensional online bin packing with rotation

This page was built for publication: Online square and cube packing

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