32 citations · 59 across the 26 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DS2012★ 32 cited
A Polylogarithimic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
Julia Chuzhoy, Shi Li
In the Edge-Disjoint Paths with Congestion problem (EDPwC), we are given an undirected n-vertex graph G, a collection M={(s_1,t_1),...,(s_k,t_k)} of demand pairs and an integer c.…
cs.DS2012
On Vertex Sparsifiers with Steiner Nodes
Julia Chuzhoy
Given an undirected graph with edge capacities for and a subset of vertices called terminals, we say that a graph is a quality- cut sp…