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

Samuel R. Buss, Peter N. Yianilos

Browse the full SODA paper archive.