Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults

Résumé

The Edge-disjoint s-t Paths Problem (s-t EDP) is a classical network design problem whose goal is to connect for some k ≥ 1 two given vertices of a graph under the condition that any k-1 edges of the graph may fail. We extend the simple uniform failure model of the s-t EDP as follows: the edge set of the graph is partitioned into vulnerable, and safe edges, and a set of at most k vulnerable edges may fail, while safe edges do not fail. In particular we study the Fault-Tolerant Path (FTP) problem, the counterpart of the Shortest s-t Path problem in this non-uniform failure model as well as the Fault-Tolerant Flow (FTF) problem, the counterpart of s-t EDP. We present complexity results alongside exact and approximation algorithms for both problems. We emphasize the vast increase in complexity of the problems compared to s-t EDP.
Fichier principal
Vignette du fichier
LIPIcs-SWAT-2022-5.pdf (808.78 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04214508 , version 1 (22-09-2023)

Identifiants

Citer

David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt. Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults. 18th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT, Jun 2022, Torshavn, Faroe Islands. pp.5:1--5:19, ⟨10.4230/LIPIcs.SWAT.2022.5⟩. ⟨hal-04214508⟩
11 Consultations
10 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More