 |
|
|
|
| HAL: hal-00459975, version 1 |
| DOI: 10.1111/j.1475-3995.2009.00698.x |
| Detailed view |  Export this paper |
|
|
| International Transactions in Operational Research 17, 1 (2010) 103-117 |
|
|
|
|
| Sensitivity analysis on the all pairs q-route flows in a network |
|
|
| Madiagne Diallo 1Serigne Gueye 2 |
|
|
| (2010-01) |
|
|
|
| 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). |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Engenharia Industrial |
|
|
|
Pontifícia Universidade Católica |
|
|
| 2: | Laboratoire de Mathématiques Appliquées du Havre (LMAH) |
|
|
|
Université du Havre |
|
|
| 3: | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
|
|
|
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges |
|
|
|
|
|
|
|
|
|
| SDS |
|
|
|
|
| Subject | : | Computer Science/Operations Research |
|
|
| multiroute flows – q-route flows – 2-cut-tree – parametric flows – sensitivity Analysis – cut-tree – multi-terminal – multiterminal |
|
| hal-00459975, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00459975 | |
| oai:hal.archives-ouvertes.fr:hal-00459975 | |
| From: Pascal Berthomé | |
| Submitted on: Thursday, 25 February 2010 17:56:00 | |
| Updated on: Thursday, 25 February 2010 17:56:00 | |
