Flow-cut gaps for integer and fractional multiflows
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
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
Flow-cut gaps for integer and fractional multiflows
Journal of Combinatorial Theory Series B
| Hi-index | 0.02 |
We show that there is no $\gamma\log\log M/\log\log\log M$-approximation for the undirected congestion minimization problem unless $NP \subseteq ZPTIME(n^{{\rm polylog} n})$, where $M$ is the size of the graph and &ggr; is some positive constant.