Recommendations
- An improved approximation algorithm for the partial Latin square extension problem.
- Approximating latin square extensions
- Completing some partial Latin squares
- An efficient local search for partial Latin square extension problem
- Completing partial Latin squares with one filled row, column and symbol
Cited in
(17)- Approximating latin square extensions
- Completing partial Latin squares with prescribed diagonals.
- On residual approximation in solution extension problems
- Completing partial Latin squares with one filled row, column and symbol
- Completing partial Latin squares with two filled rows and three filled columns
- scientific article; zbMATH DE number 5944469 (Why is no real title available?)
- A new algorithm for enumerating all possible Sudoku squares
- An efficient local search for the constrained symmetric Latin square construction problem
- On the completion of latin rectangles to symmetric latin squares
- Iterated local search with Trellis-neighborhood for the partial Latin square extension problem
- An efficient local search for partial Latin square extension problem
- scientific article; zbMATH DE number 3103360 (Why is no real title available?)
- A massively parallel evolutionary algorithm for the partial Latin square extension problem
- Approximating latin square extensions
- An improved approximation algorithm for the partial Latin square extension problem.
- On linear and semidefinite programming relaxations for hypergraph matching
- The complexity of completing partial Latin squares
This page was built for publication: On Completing Latin Squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590962)
