Complexity and approximation of an area packing problem
type: Item
instance of: scholarly article
title: Complexity and approximation of an area packing problem
zbMATH Open document ID: 1257.90083
published in: Optimization Letters
publication date: 2012-11-30T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6111680
zbMATH Keywords: area packing
zbMATH Keywords: complexity
zbMATH Keywords: approximation
zbMATH Keywords: worst case analysis
author: Cor Hurkens
author: Andrea Lodi
author: Silvano Martello
author: Michele Monaci
author: Gerhard J. Woeginger
MaRDI profile type: Publication
full work available at URL: s11590-010-0246-2
OpenAlex ID: W2117122256
cites work: The difference between consecutive primes. II
cites work: Q4198056
cites work: The number of primes in a short interval.
cites work: On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems
cites work: An approximation algorithm for sequential rectangle placement
cites work: Scheduling with deadlines and loss functions
DOI: 10.1007/S11590-010-0246-2
description: scientific article; zbMATH DE number 6111680