Geometry Helps in Matching

This publication has 10 references indexed in Scilit:

• Intersection and Closest-Pair Problems for a Set of Planar Discs
  SIAM Journal on Computing, 1985
• Computational Geometry
  Published by Springer Nature ,1985
• Data Structures and Algorithms 3
  Published by Springer Nature ,1984
• A survey of heuristics for the weighted matching problem
  Networks, 1983
• Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching
  SIAM Journal on Computing, 1983
• Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982
• Location of a Point in a Planar Subdivision and Its Applications
  SIAM Journal on Computing, 1977
• An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
  Journal of the ACM, 1976
• Maximum matching and a polyhedron with 0,1-vertices
  Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
• The Hungarian method for the assignment problem
  Naval Research Logistics Quarterly, 1955