A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs
A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs
We consider the maximum vertex-weighted matching problem (MVM), in which nonnegative weights are assigned to the vertices of a graph, the weight of a matching is the sum of the weights of the matched vertices, and we are required to compute a matching of maximum weight. We describe an exact …