Completion of partial Latin Hypercube Designs: NP-completeness and inapproximability

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.