Geometry Helps in Matching (Extended Abstract)

  title={Geometry Helps in Matching (Extended Abstract)},
  author={Pravin M. Vaidya},
A set of 2<italic>n</italic> points on the plane induces a complete weighted undirected graph as follows: The points are the vertices of the graph and the weight of an edge between any two points is the distance between the points under some metric. We study the problem of finding a minimum weight complete matching (MWCM) in such a graph. We give an <italic… CONTINUE READING