Note on the problem of partially link disjoint paths (original) (raw)
Related papers
A heuristic to generate all best partially disjoint paths in a communications network
The 8th International Conference on Communication Systems, 2002. ICCS 2002., 2002
Finding disjoint paths in networks
ACM SIGCOMM Computer Communication Review, 1991
Finding Arc and Vertex-Disjoint Paths in Networks
2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing, 2009
An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs
Journal of Computing and Information Technology
CONSTRAINED DISJOINT PATHS IN GEOMETRIC NETWORKS
Efficient heuristics for determining node-disjoint path pairs visiting specified nodes
Networks, 2017
Algorithms for determining a node-disjoint path pair visiting specified nodes
Optical Switching and Networking, 2016
Constrained Disjoint Paths in Geometric Network
International Journal of Computational Intelligence and Applications, 2009
Distributed algorithms for computing shortest pairs of disjoint paths
IEEE Transactions on Information Theory, 1993
Finding disjoint paths with different path‐costs: Complexity and algorithms
Networks, 1992
Searching the Shortest Pair of Edge-Disjoint Paths in a Communication Network. A Fuzzy Approach
Lecture Notes in Computer Science, 2019
Shortest node-disjoint paths on random graphs
Journal of Statistical Mechanics: Theory and Experiment, 2014
A quick method for finding shortest pairs of disjoint paths
Networks, 1984
Modified Widest Disjoint Paths Algorithm for Multipath Routing
Lecture Notes in Computer Science, 2007
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
Journal of the ACM, 1978
On finding disjoint paths in single and dual link cost networks
2004
Synthesis Lectures on Communication Networks, 2010
Operations Research Letters, 2007
Exploiting the diversity of shortest pairs of edge-disjoint paths
Anais do XXXVI Simpósio Brasileiro de Redes de Computadores e Sistemas Distribuídos (SBRC 2018)
Link-disjoint paths for reliable QoS routing
International Journal of Communication Systems, 2003
The complexity of finding two disjoint paths with min-max objective function
Discrete Applied Mathematics, 1990
Identifying the Shortest Path of a Semidirected Graph and Its Application
Mathematics
Solving the edge-disjoint paths problem using a two-stage method
International Transactions in Operational Research
A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018
An Appraisal of Some Shortest-Path Algorithms
Operations Research, 1969
International Journal of Metaheuristics, 2010
Handbook of Discrete and Computational Geometry, Second Edition, 2004
Finding the shortest route between two points in a network
A software package of algorithms and heuristics for disjoint paths in Planar Networks
Discrete Applied Mathematics, 1999
ACM Transactions on Algorithms, 2007
The Routing Continuum from Shortest-Path to All-Path: A Unifying Theory
2011 31st International Conference on Distributed Computing Systems, 2011
Algorithmic techniques for maintaining shortest routes in dynamic networks
2007
Finding a simple path with multiple must-include nodes
… & Simulation of …, 2009