Online Algorithms for Maximum Cardinality Matching with Edge Arrivals.

Niv Buchbinder Danny Segev Yevgeny Tkach

Published in: Algorithmica (2019)

Keyphrases

maximum cardinality
online algorithms
bipartite graph
minimum weight
online learning
undirected graph
endpoints
lower bound
learning algorithm
worst case
competitive ratio
weighted graph
average case
asymptotically optimal
greedy heuristic
special case
directed graph
edge weights