Parameterized complexity of strip packing and minimum volume packing

DOI10.1016/j.tcs.2016.11.034zbMath1356.68091OpenAlexW2560694610MaRDI QIDQ501656

Saket Saurabh, Sudeshna Kolay, Pradeesha Ashok, Syed M. Meesum

Publication date: 9 January 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.11.034

zbMATH Keywords

strip packinggreedy packingvolume minimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Related Items (1)

Grid recognition: classical and parameterized computational perspectives

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on online strip packing
• Two-dimensional packing problems: a survey
• Bin packing with fixed number of bins revisited
• Improved lower bound for online strip packing
• Parametrized complexity theory.
• A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
• Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• Optimal Rectangle Packing: An Absolute Placement Approach
• Polynomiality for Bin Packing with a Constant Number of Item Types
• Parameterized Algorithms
• Online strip packing with modifiable boxes

This page was built for publication: Parameterized complexity of strip packing and minimum volume packing