Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion
From MaRDI portal
Publication:5741732
DOI10.1137/1.9781611973105.24zbMath1421.68200OpenAlexW4232231123MaRDI QIDQ5741732
Publication date: 15 May 2019
Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973105.24
Programming involving graphs or networks (90C35) Paths and cycles (05C38) Approximation algorithms (68W25) Flows in graphs (05C21)
Related Items (10)
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs ⋮ The all-or-nothing flow problem in directed graphs with symmetric demand pairs ⋮ Unnamed Item ⋮ Shortest node-disjoint paths on random graphs ⋮ Routing with congestion in acyclic digraphs ⋮ New algorithms for maximum disjoint paths based on tree-likeness ⋮ Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators ⋮ Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators ⋮ Routing in Undirected Graphs with Constant Congestion ⋮ New Hardness Results for Routing on Disjoint Paths
This page was built for publication: Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion
