Efficient Algorithms for k-Disjoint Paths Problems on DAGs (original) (raw)
Related papers
Finding disjoint paths with different path‐costs: Complexity and algorithms
Networks, 1992
Operations Research Letters, 2007
A quick method for finding shortest pairs of disjoint paths
Networks, 1984
Improved approximation algorithms for computing k$$ k disjoint paths subject to two constraints
Journal of Combinatorial Optimization, 2013
The complexity of finding two disjoint paths with min-max objective function
Discrete Applied Mathematics, 1990
Research Ideas and Outcomes
Shortest k-Disjoint Paths via Determinants
ArXiv, 2018
Jose Renato Calixto Dos Santos
1998
Efficient Approximation Algorithms for Computing k Disjoint Restricted Shortest Paths
Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures, 2015
An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs
Journal of Computing and Information Technology
Theory of Computing Systems, 2014
Finding Arc and Vertex-Disjoint Paths in Networks
2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing, 2009
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths
Algorithmica, 2019
Decomposing DAGs into Disjoint Chains
Lecture Notes in Computer Science, 2007
A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
Journal of the ACM, 1978
Finding disjoint paths in networks
ACM SIGCOMM Computer Communication Review, 1991
One-to-many node-disjoint paths in (n, k)-star graphs
Discrete Applied Mathematics, 2010
ACM Transactions on Algorithms, 2007
Finding k -dissimilar paths with minimum collective length
Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2018
Finding k-shortest paths with limited overlap
The VLDB Journal
A heuristic to generate all best partially disjoint paths in a communications network
The 8th International Conference on Communication Systems, 2002. ICCS 2002., 2002
Scheme to Find k Disjoint Paths in Multi-Cost
2011 IEEE International Conference on Communications (ICC), 2011
A linear-time algorithm for edge-disjoint paths in planar graphs
Combinatorica, 1995
Algorithms for determining a node-disjoint path pair visiting specified nodes
Optical Switching and Networking, 2016
Routing with congestion in acyclic digraphs
Information Processing Letters, 2019
A linear programming formulation of Mader's edge-disjoint paths problem
Journal of Combinatorial Theory, Series B, 2006
Algorithms for finding internally disjoint paths in a planar graph
Electronics and Communications in Japan (Part III: Fundamental Electronic Science), 1989
Efficient heuristics for determining node-disjoint path pairs visiting specified nodes
Networks, 2017