Article dans une revue, GALaC, Complexité

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

Kaourintin Le Guiban, Arpad Rimmel, Marc-Antoine Weisser, Joanna Tomasik. Completion of partial Latin Hypercube Designs: NP-completeness and inapproximability. Theoretical Computer Science, Elsevier, 2018, 715, pp.1 - 20. ⟨10.1016/j.tcs.2018.01.014⟩. ⟨hal-01702464⟩

Publié le