Complexity and approximation results for the min-sum and min-max disjoint paths problems
From MaRDI portal
Publication:4610074
Recommendations
Cited in
(19)- Finding disjoint paths with different path-costs: Complexity and algorithms
- On shortest disjoint paths in planar graphs
- Approximating disjoint-path problems using packing integer programs
- On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems
- The checkpoint problem
- Hardness of finding two edge-disjoint Min-Min paths in digraphs
- Parallel complexity of computing a maximal set of disjoint paths
- Multi-path algorithms for minimum-colour path problems with applications to approximating barrier resilience
- The checkpoint problem
- Efficient algorithms for minimal disjoint path problems on chordal graphs
- Min-sum 2-paths problems
- scientific article; zbMATH DE number 6707504 (Why is no real title available?)
- On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time
- Min-sum 2-paths problems
- Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems
- On the approximability of time disjoint walks
- On the approximability of time disjoint walks
- Improved approximation algorithms for computing \(k\) disjoint paths subject to two constraints
- On the complexity of vertex-disjoint length-restricted path problems
This page was built for publication: Complexity and approximation results for the min-sum and min-max disjoint paths problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4610074)
