scientific article; zbMATH DE number 6851840

DOI10.4230/LIPIcs.MFCS.2016.7zbMath1398.68208arXiv1605.01866MaRDI QIDQ4608564

Saeed Akhoondian Amiri, Dániel Marx, Roman Rabinovich, Stephan Kreutzer

Publication date: 21 March 2018

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmscongestionacyclic digraphsdisjoint pathsXP\(\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)

Related Items (3)

Congestion-Free Rerouting of Flows on DAGs ⋮ The Parameterized Complexity of Finding Point Sets with Hereditary Properties ⋮ Routing with congestion in acyclic digraphs

This page was built for publication: