1 paper
J. Cheriyan, R. Cummings, J. Dippel +1
We present a 35-approximation algorithm for the matching augmentation problem (MAP): given a multi-graph with edges of cost either zero or one such that the edges of cost ze…