On completing latin squares

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4393 LNCS, Issue , 2007, Pages 524-535

  Hajirasouliha, Iman ^a   Jowhari, Hossein ^a   Kumar, Ravi ^b   Sundaram, Ravi ^c  

^a SIMON FRASER UNIVERSITY   (Canada)

^b YAHOO RESEARCH   (United States)

^c NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LEAST SQUARES APPROXIMATIONS; PROBLEM SOLVING; THRESHOLD LOGIC;

APPROXIMATION THRESHOLD; PARTIAL LATIN SQUARE EXTENSION (PLSE) PROBLEM;

APPROXIMATION ALGORITHMS;

EID: 84975751680     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70918-3_45     Document Type: Conference Paper

References (14)

1. R. A. Barry and P. A. Humblet. Latin routers, design and implementation. IEEE/OSA Journal of Lightwave Technology, pages 891-899, 1993.
2. C. J. Colbourn. The complexity of completing partial latin squares. Discrete Applied Mathematics, 8:25-30, 1984.
3. T. Evans. Embedding incomplete latin squares. American Mathematical Monthly, 67:958-961, 1960.
4. U. Feige. A threshold of In n for approximating set cover. Journal of the ACM, 45(4):634-652, 1998.
5. C. P. Gomes, R. G. Regis, and D. B. Shmoys. An improved approximation algorithm for the partial latin square extension problem. Operations Research Letters, 32(5):479-484, 2004.
6. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, 1988.
7. I. Holyer. The NP-completeness of some edge-partition problems. SIAM Journal on Computing, 10(4):713-717, 1981.
8. C. A. J. Hurkens and A. Schrijver. On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM Journal on Discrete Mathematics, 2(1):68-72, 1989.
9. N. Immorlica, M. Mahdian, and V. S. Mirrokni. Cycle cover with short cycles. In Proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science, pages 641-653, 2005.
10. R. Kumar, A. Russell, and R. Sundaram. Approximating latin square extensions. Algorithmica, 24(2):128-138, 1999.
11. P. Raghavan and C.D. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica 7(4): 365-374, 1987.
12. H. J. Ryser. A combinatorial theorem with an application to latin rectangles. Proceedings of the American Mathematical Society, 2:550-552, 1951.
13. B. Smetaniuk. A new construction on Latin squares I. A proof of the Evans conjecture. Ars Combinatoria, XL155-172, 1981.
14. J. H. van Lint and R. M. Wilson. A Course in Combinatorics. Cambridge University Press, 1992.