Failure disjoint paths

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.

Mots clés

Shortest paths Disjoint paths Polynomial time algorithms

Domaines

Mathématique discrète [cs.DM]

Médiathèque Télécom SudParis & Institut Mines-Télécom Business School : Connectez-vous pour contacter le contributeur

https://hal.science/hal-00528050

Soumis le : mercredi 20 octobre 2010-19:40:01

Dernière modification le : mardi 17 septembre 2024-15:51:35

Dates et versions

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

Identifiants

HAL Id : hal-00528050 , version 1
DOI : 10.1016/j.endm.2010.05.140

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⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS TELECOM-SUDPARIS TDS-MACS INSTITUT-MINES-TELECOM

85 Consultations

0 Téléchargements