Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching
From MaRDI portal
Publication:3967061
DOI10.1137/0212008zbMath0501.68032OpenAlexW2055674322MaRDI QIDQ3967061
Kenneth J. Supowit, Edward M. Reingold
Publication date: 1983
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0212008
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (14)
Recurrence relations based on minimization and maximization ⋮ AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ ⋮ On the Euclidean assignment problem ⋮ Asymptotics of Mahler recurrences: The cyclotomic case ⋮ Asymptotic expansions for linear homogeneous divide-and-conquer recurrences: algebraic and analytic approaches collated ⋮ Improved bounds for finger search on a RAM ⋮ Smoothed analysis of partitioning algorithms for Euclidean functionals ⋮ Algebraic aspects of B-regular series ⋮ A survey of heuristics for the weighted matching problem ⋮ Dynamic interpolation search revisited ⋮ Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy ⋮ Heuristic methods and applications: A categorized survey ⋮ Approximate minimum weight matching on points in k-dimensional space ⋮ A partitioning algorithm for minimum weighted Euclidean matching
This page was built for publication: Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching
