|
| | | |
Combining the Shortest Paths and the Bottleneck Paths Problems
Shinn, T. and Takaoka, T.
We combine the well known Shortest Paths (SP) problem and the Bottleneck Paths (BP) problem to introduce a new problem called the Shortest Paths for All Flows (SP-AF) problem that has relevance in real life applications. We first solve the Single Source Shortest Paths for All Flows (SSSP-AF) problem on directed graphs with unit edge costs in O(mn) worst case time bound. We then present two algorithms to solve SSSP-AF on directed graphs with integer edge costs bounded by c in O(m2 + nc) and O(m2 + mn log(c/m)) time bounds. Finally we extend our algorithms for the SSSP-AF problem to solve the All Pairs Shortest Paths for All Flows (APSP-AF) problem in O(m2n + nc) and O(m2n+mn2log(c/mn)) time bounds. All algorithms presented in this paper are practical for implementation. |
Cite as: Shinn, T. and Takaoka, T. (2014). Combining the Shortest Paths and the Bottleneck Paths Problems. In Proc. Thirty-Seventh Australasian Computer Science Conference (ACSC 2014) Auckland, New Zealand. CRPIT, 147. Thomas, B. and Parry, D. Eds., ACS. 13-18 |
(from crpit.com)
(local if available)
|
|