New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness
From MaRDI portal
Publication:4606313
DOI10.4230/LIPIcs.ESA.2016.42zbMath1397.68223MaRDI QIDQ4606313
Krzysztof Fleszar, Joachim Spoerhase, Matthias Mnich
Publication date: 2 March 2018
Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.ESA.2016.42
68Q25: Analysis of algorithms and problem complexity
05C38: Paths and cycles
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
Unnamed Item, Unnamed Item, Grundy Distinguishes Treewidth from Pathwidth, Unnamed Item, New algorithms for maximum disjoint paths based on tree-likeness, On structural parameterizations of the edge disjoint paths problem, The power of cut-based parameters for computing edge-disjoint paths