Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching
From MaRDI portal
Publication:3967061
DOI10.1137/0212008zbMath0501.68032MaRDI QIDQ3967061
Edward M. Reingold, Kenneth J. Supowit
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
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗, Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy, A partitioning algorithm for minimum weighted Euclidean matching, Recurrence relations based on minimization and maximization, On the Euclidean assignment problem, Heuristic methods and applications: A categorized survey, Approximate minimum weight matching on points in k-dimensional space, Asymptotics of Mahler recurrences: The cyclotomic case, Improved bounds for finger search on a RAM, Smoothed analysis of partitioning algorithms for Euclidean functionals, A survey of heuristics for the weighted matching problem