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.
Hurkens, C. A. J., Lodi, A., Martello, S., Monaci, M., & Woeginger, G. J. (2012). Complexity and approximation of an area packing problem. Optimization Letters, 6(1), 1-9. https://doi.org/10.1007/s11590-010-0246-2