Edge-disjoint paths revisited (original) (raw)
Related papers
Hardness of the undirected edge-disjoint paths problem
2005
Operations Research Letters, 2007
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion
2005
Optimal Construction of Edge-Disjoint Paths in Random Graphs
SIAM Journal on Computing, 1998
Improved approximation algorithms for computing k$$ k disjoint paths subject to two constraints
Journal of Combinatorial Optimization, 2013
Finding disjoint paths with different path‐costs: Complexity and algorithms
Networks, 1992
A linear programming formulation of Mader's edge-disjoint paths problem
Journal of Combinatorial Theory, Series B, 2006
A linear-time algorithm for edge-disjoint paths in planar graphs
Combinatorica, 1995
The complexity of finding two disjoint paths with min-max objective function
Discrete Applied Mathematics, 1990
Efficient Approximation Algorithms for Computing k Disjoint Restricted Shortest Paths
Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures, 2015
A Simple Approximation for a Hard Routing Problem
2018
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths
Algorithmica, 2019
1-Approximation algorithm for bottleneck disjoint path matching
Information Processing Letters, 1995
A quick method for finding shortest pairs of disjoint paths
Networks, 1984
Safe Approximation—An Efficient Solution for a Hard Routing Problem
Algorithms, 2021
The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
Combinatorica, 2014
Algorithmica, 2012
An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs
Journal of Computing and Information Technology
Heiko Schilling - 2010 - ACM Transactions on Algorithms - Length-Bounded Cuts and Flows
Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs
Combinatorica, 2010
Efficient Algorithms for k-Disjoint Paths Problems on DAGs
Lecture Notes in Computer Science, 2007
Edge-disjoint paths in planar graphs
Journal of Combinatorial Theory, Series B, 1985
Theory of Computing Systems, 2014
On the Complexity and Inapproximability of Dissociation Set Problems in Graphs
Hardness of Approximation for Vertex-Connectivity Network Design Problems
SIAM Journal on Computing, 2004
The complexity of dissociation set problems in graphs
Discrete Applied Mathematics, Vol. 159, No.13, 2011, 1352 - 1366, 2011
Solving the edge-disjoint paths problem using a two-stage method
International Transactions in Operational Research
The complexity of minimum-length path decompositions
Journal of Computer and System Sciences, 2015
Finding Arc and Vertex-Disjoint Paths in Networks
2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing, 2009
2-Edge Connectivity in Directed Graphs
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
Approximating Transitivity in Directed Networks
2008
Algorithms for finding internally disjoint paths in a planar graph
Electronics and Communications in Japan (Part III: Fundamental Electronic Science), 1989