On the complexity of vertex-disjoint length-restricted path problems
From MaRDI portal
Publication:1762664
DOI10.1007/s00037-003-0179-6zbMath1085.68066OpenAlexW1999679195MaRDI 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
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Paths and cycles (05C38) Connectivity (05C40)
Related Items (11)
OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks ⋮ Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation ⋮ On b-acyclic chromatic number of a graph ⋮ On the maximum disjoint paths problem on edge-colored graphs ⋮ On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow ⋮ Length 3 edge-disjoint paths is NP-hard ⋮ Paths of bounded length and their cuts: parameterized complexity and algorithms ⋮ Maximum \(k\)-splittable \(s, t\)-flows ⋮ Short length Menger's theorem and reliable optical routing ⋮ Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems ⋮ Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms
This page was built for publication: On the complexity of vertex-disjoint length-restricted path problems
