Sciweavers

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

10

SODA
1994
ACM

favoriteEmaildiscussreport

67views Algorithms» more SODA 1994»

Linear and O(n log n) Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours

13 years 5 months ago

Linear and O(n log n) Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours

Download www.math.ucsd.edu

Samuel R. Buss, Peter N. Yianilos

Real-time Traffic

Algorithms | SODA 1994 |

claim paper

Related Content

» Automatic Construction of LargeScale Regular Expression Matching Engines on FPGA

» Improved Approximation for the Directed Spanner Problem

Post Info
More Details (n/a)

Added	02 Nov 2010
Updated	02 Nov 2010
Type	Conference
Year	1994
Where	SODA
Authors	Samuel R. Buss, Peter N. Yianilos

Comments (0)