Routing with congestion in acyclic digraphs (original) (raw)
Related papers
Efficient Algorithms for k-Disjoint Paths Problems on DAGs
Lecture Notes in Computer Science, 2007
Finding disjoint paths with different path‐costs: Complexity and algorithms
Networks, 1992
A log-space algorithm for reachability in planar acyclic digraphs with few sources
… Complexity (CCC), 2010 …, 2010
Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs
Combinatorica, 2010
Operations Research Letters, 2007
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion
2005
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths
Algorithmica, 2019
Research Ideas and Outcomes
The all-pairs quickest path problem
Information Processing Letters, 1993
A parallel blocking flow algorithm for acyclic networks
Journal of Algorithms, 1992
Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzík Bound
2012
An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs I
Constructing Fair Destination-Oriented Directed Acyclic Graphs for Multipath Routing
Journal of Applied Mathematics, 2014
New Applied Problems in the Theory of Acyclic Digraphs
Mathematics, 2021
On compact and efficient routing in certain graph classes
Discrete Applied Mathematics, 2007
International Journal of Computer Applications, 2013
All-pairs bottleneck paths for general graphs in truly sub-cubic time
2007
A Simple Approximation for a Hard Routing Problem
2018
Hardness of the undirected edge-disjoint paths problem
2005
Journal of Graph Theory, 2003
Lecture Notes in Computer Science, 2014
A quick method for finding shortest pairs of disjoint paths
Networks, 1984
Shortest k-Disjoint Paths via Determinants
ArXiv, 2018
Jose Renato Calixto Dos Santos
1998
Shortest-Path Routing in Arbitrary Networks
Journal of Algorithms, 1999
Speeding up shortest path algorithms
2012
Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms
Theoretical Computer Science, 1998
Efficient Approximation Algorithms for Computing k Disjoint Restricted Shortest Paths
Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures, 2015