Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line.

Sharath Raghvendra

Published in: CoRR (2018)

Keyphrases

dynamic programming
optimal solution
worst case
online algorithms
objective function
computational complexity
np hard
optimization algorithm
cost function
bipartite matching
simulated annealing
particle swarm optimization
segmentation algorithm
tree structure
greedy heuristic
competitive ratio