An improved approximation algorithm for the partial Latin square extension problem

Open Webpage

Carla P. Gomes, Rommel G. Regis, David B. Shmoys

Published: 2004, Last Modified: 16 May 2025Oper. Res. Lett. 2004EveryoneRevisionsBibTeXCC BY-SA 4.0
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.