Problem 1. Let G = (V UV2, E) be a bipartite graph. We saw in class...

Transcribed Image Text:

Problem 1. Let G = (V UV2, E) be a bipartite graph. We saw in class the maximum size matching of G can be solved by the linear program (P) max Xe s.t. 0 xe Ve E E and Xe1 VueV eE ev (D) min by s.t. yTA Y cT 0 > Problem 1. Let G = (V UV2, E) be a bipartite graph. We saw in class the maximum size matching of G can be solved by the linear program (P) max Xe s.t. 0 xe Ve E E and Xe1 VueV eE ev (D) min by s.t. yTA Y cT 0 >