Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs
This paper addresses sensitivity analysis questions concerning the shortest path problem and the maximum capacity path problem in an undirected network. For both problems, we determine the maximum and minimum weights that each edge can have so that a given path...
| Main Authors: | , , |
|---|---|
| Format: | Working Paper |
| Language: | en_US |
| Published: |
2004
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/7389 |
| Summary: | This paper addresses sensitivity analysis questions concerning the shortest path problem and the maximum capacity
path problem in an undirected network. For both problems, we determine the maximum and minimum weights that
each edge can have so that a given path remains optimal. For both problems, we show how to determine these
maximum and minimum values for all edges in O(m + K log K) time, where m is the number of edges in the
network, and K is the number of edges on the given optimal path. |
|---|