Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

SODA
2003
ACM

favoriteEmaildiscussreport

121views Algorithms» more SODA 2003»

An improved approximation algorithm for the partial latin square extension problem

13 years 5 months ago

An improved approximation algorithm for the partial latin square extension problem

Download www.cs.cornell.edu

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

Real-time Traffic

Algorithms | Assignment Ip Formulation | IP Formulation | LP Relaxation | SODA 2003 |

claim paper

Related Content

» On Completing Latin Squares

» Approximating Latin Square Extensions

» Combinatorial Problems on Strings with Applications to Protein Folding

» Recursive least squares and quadratic prediction in continuous multistep problems

» Bootstrap AMG

» Efficient Reinforcement Learning Using Recursive LeastSquares Methods

» MiniBuckets A General Scheme for Generating Approximations in Automated Reasoning

» Taming Numbers and Durations in the Model Checking Integrated Planning System

Post Info
More Details (n/a)

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)