An improved approximation algorithm for the partial Latin square extension problem. (Q703265)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An improved approximation algorithm for the partial Latin square extension problem. |
scientific article; zbMATH DE number 2125909
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved approximation algorithm for the partial Latin square extension problem. |
scientific article; zbMATH DE number 2125909 |
Statements
An improved approximation algorithm for the partial Latin square extension problem. (English)
0 references
11 January 2005
0 references
Latin square
0 references
Randomized rounding
0 references
Approximation algorithm
0 references
0.9112185835838318
0 references
0.8127554655075073
0 references
0.8123084306716919
0 references
0.795802652835846
0 references
