A Tight Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs.
Shibsankar DasKalpesh KapoorPublished in: CoRR (2016)
Keyphrases
- bipartite graph
- lower bound
- maximum weight
- maximum weight matching
- upper bound
- edge weights
- minimum weight
- maximum matching
- branch and bound algorithm
- branch and bound
- worst case
- np hard
- maximum cardinality
- objective function
- bipartite graph matching
- optimal solution
- link prediction
- computational complexity
- markov chain
- machine learning
- active learning
- mutual reinforcement
- training data