An improved approximation algorithm for the partial Latin square extension problem

Authors:
Carla P. Gomes;Rommel G. Regis;David B. Shmoys
Affiliations:
Department of Computer Science, Cornell University, Ithaca, NY 14853, USA;School of Operations Research & Industrial Engineering, Cornell University, Ithaca, NY 14853, USA;School of Operations Research & Industrial Engineering and Department of Computer Science, Cornell University, Ithaca, NY 14853, USA
Venue:
Operations Research Letters
Year:
2004

Citing 5
Cited 1

Clique partitions, graph compression and speeding-up algorithms

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
New ${\bf \frac{3}{4}}$-Approximation Algorithms for the Maximum Satisfiability Problem

SIAM Journal on Discrete Mathematics
Fast approximation algorithms for fractional packing and covering problems

Mathematics of Operations Research
Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming

Journal of the ACM (JACM)

On completing latin squares

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Previous work on the partial Latin square extension (PLSE) problem resulted in a 2-approximation algorithm based on the LP relaxation of a three-dimensional assignment IP formulation. We present an e/(e-1)-approximation algorithm that is based on the LP relaxation of a packing IP formulation of the PLSE problem.