TY - JOUR
T1 - Complexity and approximation of an area packing problem
AU - Hurkens, C.A.J.
AU - Lodi, A.
AU - Martello, S.
AU - Monaci, M.
AU - Woeginger, G.J.
PY - 2012
Y1 - 2012
N2 - Motivated by an application in mobile telecommunication systems, we investigate a packing problem in which items are specified in terms of area constraints. We establish strong -hardness of this problem, provide a linear time 3-approximation algorithm, and discuss the combinatorics of a special case.
AB - Motivated by an application in mobile telecommunication systems, we investigate a packing problem in which items are specified in terms of area constraints. We establish strong -hardness of this problem, provide a linear time 3-approximation algorithm, and discuss the combinatorics of a special case.
U2 - 10.1007/s11590-010-0246-2
DO - 10.1007/s11590-010-0246-2
M3 - Article
SN - 1862-4472
VL - 6
SP - 1
EP - 9
JO - Optimization Letters
JF - Optimization Letters
IS - 1
ER -