Searching for "Linear and O(n log n) Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Linear and O(n log n) Time Minimum-Cost Matching Algorithms for Quasi-convex Tours (Extended
by Samuel R. Buss, Peter N. Yianilos
…Linear and O(n log n) Time Minimum-Cost Matching Algorithms for Quasi-convex Tours (Extended…
Cited by 15 (3 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB