Approximating latin square extensions

DOI10.1007/PL00009274MaRDI QIDQ1293881zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On Completing Latin Squares
• An improved approximation algorithm for the partial Latin square extension problem.
• On completing latin squares
• The complexity of completing partial Latin squares
• Completing partial Latin squares with one filled row, column and symbol

Cited in

(8)

• An improved approximation algorithm for the partial Latin square extension problem.
• The set of autotopisms of partial Latin squares
• An efficient local search for partial Latin square extension problem
• An efficient local search for the constrained symmetric Latin square construction problem
• Iterated local search with Trellis-neighborhood for the partial Latin square extension problem
• On maximal partial Latin hypercubes
• Approximating latin square extensions
• On Completing Latin Squares

This page was built for publication: Approximating latin square extensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293881)