165 search results - page 1 / 33 » On Completing Latin Squares |
IJCM
2002
13 years 4 months ago
2002
In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decompos...
STACS
2007
Springer
13 years 11 months ago
2007
Springer
We present a (2 3 − o(1))-approximation algorithm for the partial latin square extension (PLSE) problem. This improves the current best bound of 1 − 1 e due to Gomes, Regis, an...
COMBINATORICS
2000
13 years 4 months ago
2000
A construction is described for combining affine designs with complete sets of mutually orthogonal frequency squares to produce other complete sets. Key words: Matrices, orthogona...
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
ALGORITHMICA
1999
13 years 4 months ago
1999
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...