An O(M log M) Algorithm for Bipartite Matching with Roadmap Distances.
Kyle TreleavenJoshua BialkowskiEmilio FrazzoliPublished in: CoRR (2013)
Keyphrases
- dynamic programming
- cost function
- bipartite matching
- np hard
- probabilistic model
- graph structure
- benchmark problems
- particle swarm optimization
- optimization algorithm
- linear programming
- shortest path algorithm
- partial order
- social network analysis
- computational complexity
- simulated annealing
- special case
- search space