Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching

DOI10.1137/0212008MaRDI QIDQ3967061zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

computational geometrygraph algorithm

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(14)

• 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
• Dynamic interpolation search revisited
• A survey of heuristics for the weighted matching problem
• Asymptotic expansions for linear homogeneous divide-and-conquer recurrences: algebraic and analytic approaches collated
• Algebraic aspects of B-regular series
• 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

This page was built for publication: Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3967061)