12 citations · 30 across the 17 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018★ 12 cited
The Matching Augmentation Problem: A -Approximation Algorithm
Joe Cheriyan, Jack Dippel, Fabrizio Grandoni +2
We present a 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…
math.CO2018★ 4 cited
On Eulerian orientations of even-degree hypercubes
Maxwell Levit, L. Sunil Chandran, Joseph Cheriyan
It is well known that \textit{every} Eulerian orientation of an Eulerian -edge connected (undirected) graph is strongly -edge connected. An important goal in the area is to…