An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs.
Chor Ping LowPublished in: Inf. Process. Lett. (2006)
Keyphrases
- maximum matching
- bipartite graph
- matching algorithm
- maximum cardinality
- bipartite graph matching
- learning algorithm
- optimal solution
- dynamic programming
- clustering method
- maximum weight
- approximation ratio
- data sets
- matching process
- weight function
- search space
- co occurrence
- string matching
- np hard
- k means
- training set
- information retrieval