Login / Signup
A distributed-memory approximation algorithm for maximum weight perfect bipartite matching.
Ariful Azad
Aydin Buluç
Xiaoye S. Li
Xinliang Wang
Johannes Langguth
Published in:
CoRR (2018)
Keyphrases
</>
maximum weight
bipartite matching
computational complexity
minimum cost flow
np hard
objective function
probabilistic model
minimum weight
parallel implementation
optimal solution
average case
bipartite graph
tree structure
dynamic programming
special case
combinatorial optimization
shortest path problem
worst case