A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching.

Sharath Raghvendra Pankaj K. Agarwal

Published in: J. ACM (2020)

Keyphrases

worst case
computational complexity
np hard
simulated annealing
tree structure
optimal solution
dynamic programming
particle swarm optimization
bipartite matching
bayesian networks
np complete
combinatorial optimization
minimum spanning tree