A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching.

Nikhil Bansal Niv Buchbinder Anupam Gupta Joseph Naor

Published in: Algorithmica (2014)

Keyphrases

optimal solution
computational complexity
distance metric
segmentation algorithm
optimization algorithm
bipartite matching
cost function
worst case
objective function
np hard
linear programming
benchmark problems
dynamic programming
knapsack problem