Janka Chlebíková, Miroslav Chlebík. Hardness of asymptotic approximation for orthogonal rectangle packing and covering problems. Electronic Colloquium on Computational Complexity (ECCC), (019), 2006. [doi]
@article{ECCC-TR06-019,
title = {Hardness of asymptotic approximation for orthogonal rectangle packing and covering problems},
author = {Janka Chlebíková and Miroslav Chlebík},
year = {2006},
url = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-019/index.html},
researchr = {https://researchr.org/publication/ECCC-TR06-019},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
number = {019},
}