11 citations · 23 across the 4 of their papers we have counts for
1 paper · 1 filter
James R. Lee, Prasad Raghavendra
We show that the multi-commodity max-flow/min-cut gap for series-parallel graphs can be as bad as 2, matching a recent upper bound Chakrabarti, Jaffe, Lee, and Vincent for this cla…