Sciweavers

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

6

COMPGEOM
2004
ACM

favoriteEmaildiscussreport

88views Discrete Geometry» more COMPGEOM 2004»

A near-linear constant-factor approximation for euclidean bipartite matching?

13 years 10 months ago

A near-linear constant-factor approximation for euclidean bipartite matching?

Download biogeometry.duke.edu

Pankaj K. Agarwal, Kasturi R. Varadarajan

Real-time Traffic

COMPGEOM 2004 |

claim paper

Related Content

» When LP is the Cure for Your Matching Woes Improved Bounds for Stochastic Matchings

» Constantfactor approximation algorithms for identifying dynamic communities

» Matching Point Sets with Respect to the Earth Movers Distance

Post Info
More Details (n/a)

Added	30 Jun 2010
Updated	30 Jun 2010
Type	Conference
Year	2004
Where	COMPGEOM
Authors	Pankaj K. Agarwal, Kasturi R. Varadarajan

Comments (0)