On Guillotine Separability of Squares and Rectangles.

DOI10.4230/lipics.approx/random.2020.47OpenAlexW3081622196MaRDI QIDQ6084407

Arindam Khan, Unnamed Author

Publication date: 31 October 2023

Full work available at URL: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.47

zbMATH Keywords

packingsquaresguillotine cutsrectangles\(k\)-stage packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (5)

A PTAS for the horizontal rectangle stabbing problem ⋮ A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing ⋮ Tight approximation algorithms for geometric bin packing with skewed items ⋮ Peak demand minimization via sliced strip packing ⋮ Keep your distance: land division with separation

Cites Work

• Unnamed Item
• An LP-based approach to a two-stage cutting stock problem
• Approximation and online algorithms for multidimensional bin packing: a survey
• A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
• Coloring and Maximum Independent Set of Rectangles
• Improved Approximation for Vector Bin Packing
• Multistage Cutting Stock Problems of Two and More Dimensions
• Cutting glass
• Improved Approximation Algorithm for Two-Dimensional Bin Packing
• Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
• Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
• Evolutionary Computation in Combinatorial Optimization

This page was built for publication: On Guillotine Separability of Squares and Rectangles.