A 2/3-Approximation Algorithm for Vertex-weighted Matching in Bipartite Graphs.
Florin DobrianMahantesh HalappanavarAlex PothenAhmed Al-HerzPublished in: CoRR (2018)
Keyphrases
- bipartite graph
- maximum cardinality
- matching algorithm
- maximum matching
- minimum weight
- bipartite graph matching
- learning algorithm
- edge weights
- matching process
- information retrieval
- worst case
- dynamic programming
- np hard
- approximation ratio
- maximum weight
- search space
- image matching
- directed graph
- k means
- web pages
- machine learning