Journal of Combinatorial Optimization · 2012 · 25 citations · 14 references
ComputingComputer ScienceAlgorithmsOptimizationCombinatorial OptimizationGraph AlgorithmsGraph TheoryNetwork OptimizationRouting AlgorithmsShortest Path AlgorithmsShortest Path Problems
14
A quick method for finding shortest pairs of disjoint paths
J. W. Suurballe, Robert E. Tarjan · Networks · 1984 · 693 citations
Beyond the flow decomposition barrier
Andrew V. Goldberg, Satish Rao · Journal of the ACM · 1998 · 474 citations · Full text
The complexity of finding maximum disjoint paths with length constraints
Alon Itai, Yehoshua Perl, Yossi Shiloach · Networks · 1982 · 153 citations
Finding minimum-cost flows by double scaling
Ravindra K. Ahuja, Andrew V. Goldberg, James B. Orlin et al. · Mathematical Programming · 1992 · 126 citations · Full text