Sensitivity analysis on the all pairs q-route flows in a network - Archive ouverte HAL Access content directly
Journal Articles International Transactions in Operational Research Year : 2010

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).

Dates and versions

hal-00459975 , version 1 (25-02-2010)

Identifiers

Cite

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

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More