Finding disjoint paths with related path costs
From MaRDI portal
(Redirected from Publication:857785)
Recommendations
- Finding disjoint paths with different path-costs: Complexity and algorithms
- On finding Min-Min disjoint paths
- Finding disjoint paths in split graphs
- Finding disjoint paths in split graphs
- Graph-Theoretic Concepts in Computer Science
- Finding two edge-disjoint paths with length constraints
- On the disjoint paths problem
- A quick method for finding shortest pairs of disjoint paths
- Finding shortest and dissimilar paths
Cites work
- scientific article; zbMATH DE number 1187149 (Why is no real title available?)
- scientific article; zbMATH DE number 16298 (Why is no real title available?)
- scientific article; zbMATH DE number 16300 (Why is no real title available?)
- scientific article; zbMATH DE number 751135 (Why is no real title available?)
- scientific article; zbMATH DE number 6469168 (Why is no real title available?)
- A Polynomial Solution to the Undirected Two Paths Problem
- A quick method for finding shortest pairs of disjoint paths
- An overtraining-resistant stochastic modeling method for pattern recognition
- Disjoint paths in a network
- Finding disjoint paths with different path-costs: Complexity and algorithms
- Hardness of the undirected edge-disjoint paths problem
- Heuristics for finding a maximum number of disjoint bounded paths
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- On the Complexity of Timetable and Multicommodity Flow Problems
- On the Computational Complexity of Combinatorial Problems
- Optimization, approximation, and complexity classes
- Primal-dual approximation algorithms for integral flow and multicut in trees
- The complexity of finding maximum disjoint paths with length constraints
- The complexity of finding two disjoint paths with min-max objective function
- The directed subgraph homeomorphism problem
Cited in
(10)- Efficient algorithms for shared backup allocation in networks with partial information
- Hardness of finding two edge-disjoint Min-Min paths in digraphs
- An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks
- Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths
- On the complexity of the edge-disjoint min-min problem in planar digraphs
- Improved approximation algorithms for computing k disjoint paths subject to two constraints
- Efficient heuristics for determining node-disjoint path pairs visiting specified nodes
- Toward fast calculation of communication paths for resilient routing
- Building edge-failure resilient networks
- On finding Min-Min disjoint paths
This page was built for publication: Finding disjoint paths with related path costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857785)
