A Near-Linear Constant-Factor Approximation for Euclidean Bipartite Matching?∗ Pankaj K. Agarwal† ABSTRACT In the Euclidean bipartite matching problem, we are given a set R

First Page		Document Content
Date: 2011-04-05 22:51:12		A Near-Linear Constant-Factor Approximation for Euclidean Bipartite Matching?∗ Pankaj K. Agarwal† ABSTRACT In the Euclidean bipartite matching problem, we are given a set R Add to Reading List Source URL: www.cs.duke.edu Download Document from Source Website File Size: 173,57 KB Share Document on Facebook