scientific article; zbMATH DE number 6851840
DOI10.4230/LIPICS.MFCS.2016.7zbMATH Open1398.68208arXiv1605.01866MaRDI QIDQ4608564FDOQ4608564
Authors: Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich 
Publication date: 21 March 2018
Full work available at URL: https://arxiv.org/abs/1605.01866
Title of this publication is not available (Why is that?)
Recommendations
- Routing with congestion in acyclic digraphs
- Routing in undirected graphs with constant congestion
- Routing in undirected graphs with constant congestion
- Routing-proofness in congestion-prone networks
- Congestion-free rerouting of flows on DAGs
- Routing in graphs
- scientific article; zbMATH DE number 6820196
- Constant congestion routing of symmetric demands in planar directed graphs
- Congestion-free Routings of Linear Complement Permutations
- scientific article; zbMATH DE number 7650081
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cited In (8)
- The parameterized complexity of finding point sets with hereditary properties
- Congestion-free rerouting of flows on DAGs
- Congestion-free Routings of Linear Complement Permutations
- Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths
- A relaxation of the directed disjoint paths problem: a global congestion metric helps
- Routing with congestion in acyclic digraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608564)
