A 4/3-approximation algorithm for the minimum 2-edge connected subgraph problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2079404
- scientific article; zbMATH DE number 1187147
- A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem
- Finding 2-edge connected spanning subgraphs.
- Improving on the 1. 5-approximation of a smallest 2-edge connected spanning subgraph
Cited in
(34)- Finding 2-edge connected spanning subgraphs.
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
- A simple LP-based approximation algorithm for the matching augmentation problem
- A 4+ approximation for k-connected subgraphs
- A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem
- Improving on the 1. 5-approximation of a smallest 2-edge connected spanning subgraph
- scientific article; zbMATH DE number 1670548 (Why is no real title available?)
- scientific article; zbMATH DE number 1688381 (Why is no real title available?)
- A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs
- A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges
- scientific article; zbMATH DE number 437534 (Why is no real title available?)
- Toward a 6/5 bound for the minimum cost 2-edge connected subgraph problem
- Minimum 2-edge connected spanning subgraph of certain graphs
- Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem
- A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity
- scientific article; zbMATH DE number 2079404 (Why is no real title available?)
- An Ear Decomposition Approach to Approximating the Smallest 3-Edge Connected Spanning Subgraph of a Multigraph
- scientific article; zbMATH DE number 2119647 (Why is no real title available?)
- scientific article; zbMATH DE number 1405676 (Why is no real title available?)
- A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case
- Two-connected spanning subgraphs with at most \(\frac{10}{7}{\mathrm{OPT}}\) edges
- A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations
- An Improved Approximation Algorithm for the Matching Augmentation Problem
- A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case
- Color-avoiding connected spanning subgraphs with minimum number of edges
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree
- A 4/3 approximation for 2-vertex-connectivity
- On the complexity of finding a sparse connected spanning subgraph in a non-uniform failure model
- An approximation algorithm for two-edge-connected subgraph problem via triangle-free two-edge-cover
- Approximation algorithms for Steiner connectivity augmentation
- Survivable network design with group-to-group requirement
- Bridging the gap between tree and connectivity augmentation: unified and stronger approaches
- A PTAS for weighted triangle-free 2-matching
- Approximation schemes for planar graph connectivity problems
This page was built for publication: A 4/3-approximation algorithm for the minimum 2-edge connected subgraph problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4973051)
