1 results
Now showing1 - 1 of 1
- Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: with files , Fast approximation algorithms for Euclidean minimum weight perfect matchingWe study the Euclidean minimum weight perfect matching problem for n points in the plane. It is known that any deterministic approximation algorithm whose approximation ratio depends only on n requires at least Ω(nlogn) time. We propose such an algorithm for the Euclidean minimum weight perfect matching problem with runtime O(nlogn) and show that it has approximation ratio O(n0.206). This improves the so far best known approximation ratio of n/2. We also develop an O(nlogn) algorithm for the Euclidean minimum weight perfect matching problem in higher dimensions and show it has approximation ratio O(n0.412) in all fixed dimensions.Publicationtype: Journal Article40 10