Failure disjoint paths - Archive ouverte HAL
Article Dans Une Revue Electronic Notes in Discrete Mathematics Année : 2010

Failure disjoint paths

Résumé

Given a weighted directed graph where some arcs can fail while others are reliable, we aim to compute a shortest pair of failure-disjoint paths. If a reliable arc is used by both paths, its cost is counted only once. We present a polynomial time algorithm to solve the problem.

Dates et versions

hal-00528050 , version 1 (20-10-2010)

Identifiants

Citer

Mateusz Zotkiewicz, Walid Ben-Ameur, Michal Pioro. Failure disjoint paths. Electronic Notes in Discrete Mathematics, 2010, 36 (1), pp.1105-1112. ⟨10.1016/j.endm.2010.05.140⟩. ⟨hal-00528050⟩
85 Consultations
0 Téléchargements

Altmetric

Partager

More