An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs
From MaRDI portal
Publication:975758
DOI10.1007/S10878-009-9255-4zbMATH Open1188.90059OpenAlexW2011785028MaRDI QIDQ975758FDOQ975758
Authors: Teresa Gomes, Luísa Jorge, José F. Craveirinha 
Publication date: 11 June 2010
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-009-9255-4
Recommendations
- An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
- An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks
- Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
- Finding Disjoint Routes in Telecommunications Networks with Two Technologies
- Finding disjoint paths with different path-costs: Complexity and algorithms
Cites Work
- Title not available (Why is that?)
- A new implementation of Yen's ranking loopless paths algorithm
- Disjoint paths in a network
- DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
- Finding the K Shortest Loopless Paths in a Network
- A quick method for finding shortest pairs of disjoint paths
- Finding disjoint paths with different path-costs: Complexity and algorithms
- An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
Cited In (7)
- Finding Disjoint Routes in Telecommunications Networks with Two Technologies
- Title not available (Why is that?)
- Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
- An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
- Minimum cost disjoint paths under arc dependences. Algorithms for practice.
- Title not available (Why is that?)
- Color-coding algorithms to the balanced path problem: computational issues
This page was built for publication: An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975758)
