Parameterized complexity of strip packing and minimum volume packing
type: Item
instance of: scholarly article
title: Parameterized complexity of strip packing and minimum volume packing
zbMATH Open document ID: 1356.68091
author: Pradeesha Ashok
author: Sudeshna Kolay
author: Saket Saurabh
author: S. M. Meesum
published in: Theoretical Computer Science
publication date: 2017-01-09T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6672919
zbMATH Keywords: strip packing
zbMATH Keywords: volume minimization
zbMATH Keywords: greedy packing
MaRDI profile type: Publication
full work available at URL: j.tcs.2016.11.034
OpenAlex ID: W2560694610
cites work: Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons
cites work: Q4636493
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: Q5685847
cites work: Parameterized Algorithms
cites work: Q4393480
cites work: Parametrized complexity theory.
cites work: Polynomiality for Bin Packing with a Constant Number of Item Types
cites work: Improved lower bound for online strip packing
cites work: Optimal Rectangle Packing: An Absolute Placement Approach
cites work: Online strip packing with modifiable boxes
cites work: Bin packing with fixed number of bins revisited
cites work: A near-optimal solution to a two-dimensional cutting stock problem
cites work: Two-dimensional packing problems: a survey
cites work: A note on online strip packing
DOI: 10.1016/J.TCS.2016.11.034
description: scientific article; zbMATH DE number 6672919