A survey of heuristics for the weighted matching problem

This publication has 13 references indexed in Scilit:

• Heuristics for planar minimum-weight perfect metchings
  Networks, 1983
• On a Greedy Heuristic for Complete Matching
  SIAM Journal on Computing, 1981
• Linear-time approximation algorithms for finding the minimum-weight perfect matching on a plane
  Information Processing Letters, 1981
• Subadditive Euclidean Functionals and Nonlinear Growth in Geometric Probability
  The Annals of Probability, 1981
• Worst case bounds for the Euclidean matching problem
  Computers & Mathematics with Applications, 1981
• Matchings in random regular bipartite digraphs
  Discrete Mathematics, 1980
• Decomposable searching problems I. Static-to-dynamic transformation
  Journal of Algorithms, 1980
• Paths, Trees, and Flowers
  Canadian Journal of Mathematics, 1965
• On Approximation Methods for the Assignment Problem
  Journal of the ACM, 1962
• The shortest path through many points
  Mathematical Proceedings of the Cambridge Philosophical Society, 1959