A near-linear time ε-approximation algorithm for geometric bipartite matching.

R. Sharathkumar Pankaj K. Agarwal

Published in: STOC (2012)

Keyphrases

worst case
bipartite matching
dynamic programming
optimization algorithm
combinatorial optimization
search space
np hard
upper bound
knapsack problem
minimum cost flow
objective function
computational complexity
evolutionary algorithm
simulated annealing
tree structure
minimum spanning tree