An improved approximation algorithm for the partial Latin square extension problem

Operations Research Letters

Volumn 32, Issue 5, 2004, Pages 479-484

  Gomes, Carla P ^a   Regis, Rommel G ^b   Shmoys, David B ^b  

^a School of Operations Research and Information Engineering   (United States)

^b School of Operations Research and Industrial Engineering   (United States)

Author keywords

Approximation algorithm; Latin square; Randomized rounding

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BINARY CODES; INTEGER PROGRAMMING; LINEAR PROGRAMMING; POLYNOMIALS;

APPROXIMATION ALGORITHM; LATIN SQUARE; LINEAR PROGRAMMING RELAXATION; RANDOMIZED ROUNDING;

PROBLEM SOLVING;

EID: 2342576868     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2003.09.007     Document Type: Article

References (13)

1. Barry R.A., Hublet P.A. Latin routers, design and implementation. IEEE/OSA J. Lightwave Tech. 11:1993;891-899.
2. Chvatal V. Linear Programming. 1983;W.H. Freeman Company, San Francisco.
3. Colbourn C.J. The complexity of completing partial Latin squares. Discrete Appl. Math. 8:1984;25-30.
4. Denes J., Keedwell A.D. Latin Squares and their Applications. 1974;Academic Press, Inc., New York.
5. J. Denes, A.D. Keedwell (Eds.), Latin squares: New developments in the theory and applications, Ann. Discrete Math. 46 (1991).
6. T. Feder, R. Motwani, Clique partitions, graph compression and speeding-up algorithms, in: Proceedings of the 23rd Annual ACM Symposium on the Theory of Computing, New Orleans, 1991, pp. 122-133.
7. Goemans M.X., Williamson D.P. New. 3/4 -approximation algorithms for MAX SAT SIAM J. Discrete Math. 7:1994;656-666.
8. C.P. Gomes, D.B. Shmoys, The promise of LP to boost CSP techniques for combinatorial problems, in: Proceedings of the Fourth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'02), Le Croisic, France, 2002, pp. 291-305.
9. Gonzalez T., Sahni S. Open shop scheduling to minimize finish time. J. ACM. 23(4):1976;665-679.
10. Grötschel M., Lovász L., Schrijver A. Geometric Algorithms and Combinatorial Optimization. 1993;Springer, New York.
11. Kumar S.R., Russell A., Sundaram R. Approximating Latin square extensions. Algorithmica. 24:1999;128-138.
12. Lawler E.L., Labetoulle J. On Preemptive scheduling of unrelated parallel processors by linear programming. J. ACM. 25(4):1978;612-619.
13. Plotkin S.A., Shmoys D.B., Tardos É. Approximation algorithms for fractional packing and covering problems. Math. Oper. Res. 20:1995;257-301.