Online square-into-square packing
From MaRDI portal
Publication:521815
DOI10.1007/s00453-016-0114-2zbMath1364.90288arXiv1403.5665OpenAlexW2159840642MaRDI QIDQ521815
Sándor P. Fekete, Hella-Franziska Hoffmann
Publication date: 12 April 2017
Published in: Algorithmica, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.5665
Related Items (5)
Improved Bound for Online Square-into-Square Packing ⋮ 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 ⋮ Online square-into-square packing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A \((5/3+\varepsilon)\)-approximation for strip packing
- Online square packing with gravity
- Online square-into-square packing
- On packing squares into a rectangle
- Rectangle packing with one-dimensional resource augmentation
- Packing into the smallest square: worst-case analysis of lower bounds
- Maximizing the total profit of rectangles packed into a rectangle
- Online removable square packing
- Approximation algorithms for orthogonal packing problems for hypercubes
- On-line packing sequences of cubes in the unit cube
- Bounds for online bounded space hypercube packing
- Online square and cube packing
- Resource augmentation in two-dimensional packing with orthogonal rotations
- A Harmonic Algorithm for the 3D Strip Packing Problem
- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
- Online Square Packing
- A Polynomial Time Approximation Scheme for the Square Packing Problem
- New Approximability Results for 2-Dimensional Packing Problems
- On strip packing With rotations
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
- A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability
- On Two Dimensional Packing
- TWO FOR ONE: TIGHT APPROXIMATION OF 2D BIN PACKING
- Improved Approximation Algorithm for Two-Dimensional Bin Packing
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Packing d-Dimensional Bins in d Stages
- Mathematical Foundations of Computer Science 2005
- Some packing and covering theorems
- On packing of squares and cubes
- Packing Squares in Rectangles I
- Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
- New Approximability Results for Two-Dimensional Bin Packing
This page was built for publication: Online square-into-square packing
