Sensitivity analysis on the all pairs q-route flows in a network

Abstract : Given an undirected edge-weighted network in which one edge capacity is allowed to vary, we propose in this paper a polynomial algorithm that needs only two 2-cuttrees computations to provide the all pairs maximum 2-route flow values. Moreover, we provide an extension to the case where k edge capacities may vary, and show that 2^k 2-cut-trees computations are necessary in order to determine the all pairs maximum 2-route-flow values. This makes our algorithm polynomial whenever k = O(polylog n).
Document type :
Journal articles
International Transactions in Operational Research, Wiley, 2010, 17 (1), pp.103-117. 〈10.1111/j.1475-3995.2009.00698.x〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00459975
Contributor : Pascal Berthomé <>
Submitted on : Thursday, February 25, 2010 - 5:56:00 PM
Last modification on : Monday, October 23, 2017 - 2:38:01 PM

Links full text

Identifiers

Citation

Madiagne Diallo, Serigne Gueye, Pascal Berthomé. Sensitivity analysis on the all pairs q-route flows in a network. International Transactions in Operational Research, Wiley, 2010, 17 (1), pp.103-117. 〈10.1111/j.1475-3995.2009.00698.x〉. 〈hal-00459975〉

Share

Metrics

Record views

159