Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2
From MaRDI portal
Publication:5495017
DOI10.1109/FOCS.2011.30zbMath1292.05095MaRDI QIDQ5495017
Loïc Séguin-Charbonneau, F. Bruce Shepherd
Publication date: 30 July 2014
Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (10)
Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation ⋮ All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs ⋮ Unnamed Item ⋮ New algorithms for maximum disjoint paths based on tree-likeness ⋮ Maximum edge-disjoint paths in planar graphs with congestion 2 ⋮ 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 ⋮ An Approximation Algorithm for Fully Planar Edge-Disjoint Paths ⋮ Integer plane multiflow maximisation: one-quarter-approximation and gaps
This page was built for publication: Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2
