Approximation algorithms for bipartite matching with metric and geometric costs
an n5 / 2 algorithm for maximum matchings in bipartite graphs .