Approximating latin square extensions

DOI10.1007/PL00009274zbMath0934.68123OpenAlexW1973780352MaRDI QIDQ1293881

K. Appert

Publication date: 29 June 1999

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009274

zbMATH Keywords

greedy algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (4)

The set of autotopisms of partial Latin squares ⋮ On maximal partial Latin hypercubes ⋮ Iterated local search with Trellis-neighborhood for the partial Latin square extension problem ⋮ An improved approximation algorithm for the partial Latin square extension problem.

This page was built for publication: Approximating latin square extensions