Fault-tolerant edge-disjoint s-t paths -- beyond uniform faults

DOI10.4230/LIPICS.SWAT.2022.5MaRDI QIDQ6544060zbMATH OpenFDO

Authors David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt

Publication date 27 May 2024

Full work available at URL https://doi.org/10.4230/LIPICS.SWAT.2022.5

zbMATH Keywords

approximation algorithmsfault tolerancegraph algorithmsnetwork design

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(8)

• An O( n)-approximation algorithm for (p, q)-flexible graph connectivity via independent rounding
• On the complexity of finding a sparse connected spanning subgraph in a non-uniform failure model
• Improved approximations for flexible network design
• When does FTP become FPT??
• Protecting the connectivity of a graph under non-uniform edge failures
• When does FTP become FPT?
• Protecting the connectivity of a graph under nonuniform edge failures
• Fault-tolerant matroid bases

This page was built for publication: Fault-tolerant edge-disjoint \(s\)-\(t\) paths -- beyond uniform faults

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6544060)