Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs
Name
4465-03.pdf
Size
493.01 KB
Format
Adobe PDF
Checksum (MD5)
067bdf3f09724ed0561af0a894144984
Author(s)
Ramaswamy, Ramkumar
Orlin, James B.
Chakravarty, Nilopal
Date Issued
April 30, 2004
Series/Report no.
MIT Sloan School of Management Working Paper;4465-03
Abstract
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.
Subjects
sensitivity analysis
shortest path problem
bottleneck shortest path
maximum capacity path problem
Persistent DSpace Link
