Approximating latin square extensions

DOI10.1007/3-540-61332-3_162zbMath1529.68322OpenAlexW1953661109MaRDI QIDQ6184673

S. Ravi Kumar, Alexander Russell, Ravi Sundaram

Publication date: 29 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61332-3_162

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Approximation algorithms (68W25)

Cites Work

• The complexity of completing partial Latin squares
• Embedding Incomplete Latin Squares
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Distinct representatives of subsets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item