How to Secure Matchings against Edge Failures
From MaRDI portal
Recommendations
Cites work
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- An s-t connection problem with adaptability
- Analytical approach to parallel repetition
- Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding
- Approximation Algorithms for Several Graph Augmentation Problems
- Approximation algorithms for spanner problems and directed Steiner forest
- Augmentation Problems
- Bulk-robust combinatorial optimization
- Coverings of Bipartite Graphs
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- How to Secure Matchings Against Edge Failures
- scientific article; zbMATH DE number 5016662 (Why is no real title available?)
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- Improved approximation algorithms for directed Steiner forest
- Improving on the 1. 5-approximation of a smallest 2-edge connected spanning subgraph
- Making bipartite graphs DM-irreducible
- Matching preclusion for some interconnection networks
- On the NP-completeness of the perfect matching free subgraph problem
- Parameterized algorithms
- Polylogarithmic inapproximability
- Robust assignments via ear decompositions and randomized rounding
- Robust recoverable perfect matchings
- Set connectivity problems in undirected graphs and the directed Steiner network problem
- The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
- The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm
- Totally-Balanced and Greedy Matrices
Cited in
(3)
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 Q5157391)
