An improved approximation algorithm for the partial latin square extension problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 832-833

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

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

^b Cornell University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; ERROR CORRECTION; FIBER OPTIC NETWORKS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; RANDOM PROCESSES; STATISTICAL METHODS; WIDE AREA NETWORKS;

ERROR CORRECTING CODES; PARTIAL LATIN SQUARES; POLYNOMIAL TIME ALGORITHM; WAVELENGTH ROUTING;

ALGORITHMS;

EID: 0037739868     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. R. A. Barry and P. A. Hublet. Latin routers, design and implementation. IEEE/OSA J. Lightwave Tech., 11:891-899, 1993.
2. V. Chvatal. Linear Programming. W. H. Freeman Company, San Francisco, 1983.
3. C. J. Colbourn. The complexity of completing partial latin squares. Discrete Appl. Math., 8:25-30, 1984.
4. J. Denes and A. D. Keedwell. Latin Squares and Their Applications. Academic Press, Inc. NY, 1974.
5. J. Denes and A. D. Keedwell. Latin Squares: New Developments in the Theory and Applications. Annals of Discrete Math 46, 1991.
6. M. X. Goemans and D. P. Williamson. New 3/4-Approximation Algorithms for MAX SAT. SIAM J. Discrete Math., 7:656-666, 1994.
7. C. P. Gomes and D. B. Shmoys. The Promise of LP to Boost CSP Techniques for Combinatorial Problems. In Proceedings of the 4th International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'02), pages 291-305, 2002.
8. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms & Combinatorial Optimization Springer-Verlag, New York, 1993.
9. S. R. Kumar, A. Russell, and R. Sundaram. Approximating Latin Square Extensions. Algorithmica, 24:128-138, 1999.
10. S. A. Plotkin, D. B. Shmoys, and É. Tardos, Approximation algorithms for fractional packing and covering problems. Math. Oper. Res. 20:257-301, 1995.