An approximation algorithm for two-edge-connected subgraph problem via triangle-free two-edge-cover
From MaRDI portal
Cites work
- A 4/3-approximation algorithm for the minimum 2-edge connected subgraph problem
- A (1.5+)-approximation algorithm for weighted connectivity augmentation
- A Better Approximation Ratio for the Minimum Sizek-Edge-Connected Spanning Subgraph Problem
- A better-than-2 approximation for weighted tree augmentation
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A matching problem with side conditions
- A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs
- A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges
- Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching
- Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding
- Biconnectivity approximations and graph carvings
- Breaching the 2-approximation barrier for the forest augmentation problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- scientific article; zbMATH DE number 1670548 (Why is no real title available?)
- scientific article; zbMATH DE number 1305417 (Why is no real title available?)
- Improved Approximation for Two-Edge-Connectivity
- Improving on the 1. 5-approximation of a smallest 2-edge connected spanning subgraph
- Iterated rounding algorithms for the smallest k-edge connected spanning subgraph
- Polyhedron of triangle-free simple 2-matchings in subcubic graphs
- Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
- Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
Cited in
(5)
This page was built for publication: An approximation algorithm for two-edge-connected subgraph problem via triangle-free two-edge-cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6953166)
