IDEAS home Printed from
   My bibliography  Save this paper

Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs


  • Ramaswamy, Ramkumar
  • Orlin, James B.
  • Chakravarty, Nilopal


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.

Suggested Citation

  • Ramaswamy, Ramkumar & Orlin, James B. & Chakravarty, Nilopal, 2004. "Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs," Working papers 4465-03, Massachusetts Institute of Technology (MIT), Sloan School of Management.
  • Handle: RePEc:mit:sloanp:5065

    Download full text from publisher

    File URL:
    Download Restriction: no


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:mit:sloanp:5065. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christian Zimmermann). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.