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.

• Type: Conference
• Year: 2003
• Where: SODA
• Authors: Carla P. Gomes, Rommel G. Regis, David B. Shmoys
• Keywords: Algorithms, Assignment Ip Formulation, IP Formulation, LP Relaxation, SODA 2003