Hardness of approximation for orthogonal rectangle packing and covering problems
type: Item
instance of: scholarly article
title: Hardness of approximation for orthogonal rectangle packing and covering problems
zbMATH Open document ID: 1178.68282
author: Miroslav Chlebík
author: Janka Chlebíková
published in: Journal of Discrete Algorithms
publication date: 2009-06-24T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 52C15
Mathematics Subject Classification ID: 52C17
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5569525
zbMATH Keywords: orthogonal rectangle packing
zbMATH Keywords: rectangle covering
zbMATH Keywords: packing and covering with rotations
zbMATH Keywords: inapproximability results
MaRDI profile type: Publication
full work available at URL: j.jda.2009.02.002
OpenAlex ID: W2045601300
cites work: Q4258216
cites work: Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
cites work: Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
cites work: Q5501259
cites work: Q4252288
cites work: Complexity of approximating bounded variants of optimization problems
cites work: Better approximation algorithms for bin covering
cites work: An on-line algorithm for multidimensional bin packing
cites work: Bin packing can be solved within 1+epsilon in linear time
cites work: Q4737542
cites work: An asymptotic fully polynomial time approximation scheme for bin covering.
cites work: An asymptotic approximation algorithm for 3D-strip packing
cites work: On strip packing With rotations
cites work: Q5501261
cites work: Maximum bounded 3-dimensional matching is MAX SNP-complete
cites work: A near-optimal solution to a two-dimensional cutting stock problem
cites work: On Three-Dimensional Packing
cites work: Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
cites work: LATIN 2004: Theoretical Informatics
cites work: The hardness of approximation: Gap location
cites work: There is no asymptotic PTAS for two-dimensional vector packing
DOI: 10.1016/J.JDA.2009.02.002
description: scientific article; zbMATH DE number 5569525