A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates.

R. Sharathkumar

Published in: SoCG (2013)

Keyphrases

computational complexity
objective function
optimal solution
cost function
np hard
dynamic programming
convex hull
search space
optimization algorithm
test problems
bipartite matching
simulated annealing
tree structure
complex networks
shortest path problem