A near-linear constant-factor approximation for euclidean bipartite matching?

Pankaj K. Agarwal Kasturi R. Varadarajan

Published in: SCG (2004)

Keyphrases

minimum cost flow
bipartite matching
constant factor approximation
approximation algorithms
shortest path
np hard
special case
closest string
euclidean distance
euclidean space
optimal solution
linear programming