Sciweavers

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

32

SODA
1994
ACM

favoriteEmaildiscussreport

89views Algorithms» more SODA 1994»

Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances

14 years 6 days ago

Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances

Download www-math.mit.edu

David P. Williamson, Michel X. Goemans

Real-time Traffic

Algorithms | SODA 1994 |

claim paper

Related Content

» LargeScale Support Vector Learning with Structural Kernels

» Neurodynamic programming a case study of the traveling salesman problem

» Online allocation of display advertisements subject to advanced sales contracts

» Multiclass cosegmentation

Post Info
More Details (n/a)

Added	02 Nov 2010
Updated	02 Nov 2010
Type	Conference
Year	1994
Where	SODA
Authors	David P. Williamson, Michel X. Goemans

Comments (0)