Article ID Journal Published Year Pages File Type
6875597 Theoretical Computer Science 2018 20 Pages PDF
Abstract
We introduce a generalization of the Maximin LHD construction, the Maximin LHD completion, in which some points of the design are already fixed. We study the complexity of this problem and prove that it is NP-complete and it does not admit any approximation algorithm in most practical cases.
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
, , , ,