Pages that link to "Item:Q324874"
From MaRDI portal
The following pages link to Toward a 6/5 bound for the minimum cost 2-edge connected subgraph problem (Q324874):
Displaying 4 items.
- A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs (Q284336) (← links)
- A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges (Q298954) (← links)
- Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes (Q2067494) (← links)
- Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph (Q5346544) (← links)