scientific article; zbMATH DE number 6851840

DOI10.4230/LIPICS.MFCS.2016.7MaRDI QIDQ4608564zbMATH OpenFDO

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

zbMATH Keywords

algorithmscongestiondisjoint pathsXPacyclic digraphs\(\mathrm{W}[1\)-hard]

Mathematics Subject Classification ID

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)

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

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
• scientific article; zbMATH DE number 3848940 (Why is no real title available?)
• scientific article; zbMATH DE number 6820196 (Why is no real title available?)

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)