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.

Saved in:
Bibliographic Details
Published inElectronic notes in discrete mathematics Vol. 36; no. 1; pp. 1105 - 1112
Main Authors Zotkiewicz, Mateusz, Ben-Ameur, Walid, Pioro, Michal
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.08.2010
Elsevier
Subjects
Computer Science
Discrete Mathematics
disjoint paths
Electrical Engineering, Electronic Engineering, Information Engineering
Elektroteknik och elektronik
Engineering and Technology
polynomial time algorithms
shortest paths
Teknik
polynomial time algorithms
shortest paths
disjoint paths
Shortest paths
Disjoint paths
Polynomial time algorithms
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:1571-0653
1571-0653
DOI:10.1016/j.endm.2010.05.140