How to Secure Matchings Against Edge Failures
From MaRDI portal
Publication:5090488
DOI10.4230/LIPIcs.STACS.2019.38OpenAlexW2962748284MaRDI QIDQ5090488
Moritz Mühlenthaler, Oliver Schaudt, Felix Hommelsheim
Publication date: 18 July 2022
Full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2019.38
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the NP-completeness of the perfect matching free subgraph problem
- An \(s\)-\(t\) connection problem with adaptability
- Approximation algorithms for spanner problems and directed Steiner forest
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Bulk-robust combinatorial optimization
- Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph
- Approximating the smallest k -edge connected spanning subgraph by LP-rounding
- Coverings of Bipartite Graphs
- The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
- Polylogarithmic inapproximability
- Totally-Balanced and Greedy Matrices
- Approximation Algorithms for Several Graph Augmentation Problems
- Augmentation Problems
- Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
- Robust Assignments via Ear Decompositions and Randomized Rounding
- Making Bipartite Graphs DM-Irreducible
- Robust recoverable perfect matchings
- Matching preclusion for some interconnection networks
- Parameterized Algorithms
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
This page was built for publication: How to Secure Matchings Against Edge Failures
