Finding disjoint paths with related path costs
From MaRDI portal
Publication:857785
DOI10.1007/S10878-006-8906-YzbMATH Open1132.90305OpenAlexW2032753014MaRDI QIDQ857785FDOQ857785
T. V. Lakshman, Randeep Bhatia, Murali Kodialam
Publication date: 5 January 2007
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-006-8906-y
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
- An overtraining-resistant stochastic modeling method for pattern recognition
- Optimization, approximation, and complexity classes
- The directed subgraph homeomorphism problem
- A Polynomial Solution to the Undirected Two Paths Problem
- The complexity of finding two disjoint paths with min-max objective function
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Complexity of Timetable and Multicommodity Flow Problems
- Heuristics for finding a maximum number of disjoint bounded paths
- Disjoint paths in a network
- The complexity of finding maximum disjoint paths with length constraints
- On the Computational Complexity of Combinatorial Problems
- Title not available (Why is that?)
- A quick method for finding shortest pairs of disjoint paths
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Finding disjoint paths with different path-costs: Complexity and algorithms
- Hardness of the undirected edge-disjoint paths problem
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
- Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths
- On the complexity of the edge-disjoint min-min problem in planar digraphs
- Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs
- Improved approximation algorithms for computing \(k\) disjoint paths subject to two constraints
- 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)
