Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Inapproximability Results for Orthogonal Rectangle Packing Problems with RotationsMiroslav Chlebík, Janka Chlebíková. ciac 2006: 199-210 [doi]
The following publications are possibly variants of this publication: