A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching.
Sharath RaghvendraPublished in: APPROX-RANDOM (2016)
Keyphrases
- dynamic programming
- optimal solution
- worst case
- objective function
- search space
- simulated annealing
- ant colony optimization
- computational complexity
- optimization algorithm
- bipartite matching
- greedy heuristic
- minimum cost
- graph structure
- combinatorial optimization
- distance metric
- tree structure
- segmentation algorithm
- particle swarm optimization
- optimization problems