On the weighted Euclidean matching problem in Rd
Birgit Anthes, Ludger Rüschendorf · Applicationes Mathematicae · 2001
A partitioning algorithm for the Euclidean matching problem in ${\Bbb R}^d$ is introduced and analyzed in a probabilistic model. The algorithm uses elements from the fixed dissection algorithm of Karp and Steele (1985) and the Zig-Zag algorithm of Halton