Sciweavers

Share
SODA
2003
ACM

An improved approximation algorithm for the partial latin square extension problem

9 years 16 days ago
An improved approximation algorithm for the partial latin square extension problem
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. c 2003 Published by Elsevier B.V.
Carla P. Gomes, Rommel G. Regis, David B. Shmoys
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 2003
Where SODA
Authors Carla P. Gomes, Rommel G. Regis, David B. Shmoys
Comments (0)
books