How to Secure Matchings Against Edge Failures
From MaRDI portal
Publication:5090488
DOI10.4230/LIPICS.STACS.2019.38OpenAlexW2962748284MaRDI QIDQ5090488FDOQ5090488
Authors: Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt 
Publication date: 18 July 2022
Full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2019.38
Recommendations
- How to Secure Matchings against Edge Failures
- Maintaining bipartite matchings in the presence of failures
- On the Resiliency of Randomized Routing Against Multiple Edge Failures
- The cost of edge failure with respect to secure graph domination
- Building edge-failure resilient networks
- scientific article; zbMATH DE number 2086939
- scientific article; zbMATH DE number 140110
- A network design problem with two-edge matching failures
- Edge-integrity: A survey
Cites Work
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Polylogarithmic inapproximability
- Title not available (Why is that?)
- Parameterized Algorithms
- Improving on the 1. 5-approximation of a smallest 2-edge connected spanning subgraph
- Title not available (Why is that?)
- Matching preclusion for some interconnection networks
- Coverings of Bipartite Graphs
- Totally-Balanced and Greedy Matrices
- Augmentation Problems
- The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
- Set connectivity problems in undirected graphs and the directed Steiner network problem
- On the NP-completeness of the perfect matching free subgraph problem
- Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding
- An \(s\)-\(t\) connection problem with adaptability
- Approximation Algorithms for Several Graph Augmentation Problems
- Title not available (Why is that?)
- Bulk-robust combinatorial optimization
- Robust Assignments via Ear Decompositions and Randomized Rounding
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
- Title not available (Why is that?)
- Robust recoverable perfect matchings
- Approximation algorithms for spanner problems and directed Steiner forest
- Making Bipartite Graphs DM-Irreducible
Cited In (2)
This page was built for publication: How to Secure Matchings Against Edge Failures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090488)
