Sciweavers

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

9

FOCS
1998
IEEE

favoriteEmaildiscussreport

87views Theoretical Computer Science» more FOCS 1998»

A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane

13 years 8 months ago

A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane

Download www.cs.uiowa.edu

Kasturi R. Varadarajan

Real-time Traffic

FOCS 1998 | Theoretical Computer Science |

claim paper

Related Content

» Inner Rectangular Drawings of Plane Graphs

» Automatic symmetry plane estimation of bilateral objects in point clouds

» An OnTime Algorithm for the PairedDomination Problem on Permutation Graphs

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1998
Where	FOCS
Authors	Kasturi R. Varadarajan

Comments (0)