The disjoint paths problem: algorithm and structure
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two
Proceedings of the forty-third annual ACM symposium on Theory of computing
New Constructive Aspects of the Lovász Local Lemma
Journal of the ACM (JACM)
On vertex sparsifiers with Steiner nodes
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Approximation algorithms and hardness of integral concurrent flow
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Routing in undirected graphs with constant congestion
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Large-treewidth graph decompositions and applications
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We study the Edge-Disjoint Paths with Congestion (EDPwC) problem in undirected networks in which we must integrally route a set of demands without causing large congestion on an edge. We present a $(polylog(n), poly(\log\log n))$-approximation, which means that if there exists a solution that routes $X$ demands integrally on edge-disjoint paths (i.e. with congestion $1$), then the approximation algorithm can route $X/polylog(n)$ demands with congestion $poly(\log\log n)$. The best previous result for this problem was a $(n^{1/\beta}, \beta)$-approximation for $\beta