Routing in undirected graphs with constant congestion

DOI10.1145/2213977.2214054zbMath1286.05061arXiv1107.2554OpenAlexW2069159763MaRDI QIDQ5415520

Julia Chuzhoy

Publication date: 13 May 2014

Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.2554

zbMATH Keywords

approximation algorithmsnetwork routingedge-disjoint paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Approximation algorithms (68W25) Flows in graphs (05C21)

Related Items (6)

New algorithms for maximum disjoint paths based on tree-likeness ⋮ Maximum edge-disjoint paths in planar graphs with congestion 2 ⋮ Improved Guarantees for Vertex Sparsification in Planar Graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An Approximation Algorithm for Fully Planar Edge-Disjoint Paths

This page was built for publication: Routing in undirected graphs with constant congestion