On the complexity of vertex-disjoint length-restricted path problems
From MaRDI portal
Publication:1762664
DOI10.1007/s00037-003-0179-6zbMath1085.68066MaRDI QIDQ1762664
Publication date: 11 February 2005
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-003-0179-6
68Q25: Analysis of algorithms and problem complexity
90C27: Combinatorial optimization
05C38: Paths and cycles
05C40: Connectivity
Related Items
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems, On the maximum disjoint paths problem on edge-colored graphs, Length 3 edge-disjoint paths is NP-hard, Paths of bounded length and their cuts: parameterized complexity and algorithms, Short length Menger's theorem and reliable optical routing, Maximum \(k\)-splittable \(s, t\)-flows, Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation, Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms