Pages that link to "Item:Q2680988"
From MaRDI portal
The following pages link to A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem (Q2680988):
Displaying 6 items.
- A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs (Q284336) (← links)
- (Q3840352) (← links)
- A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem (Q4973051) (← links)
- Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph (Q5346544) (← links)
- Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs (Q5428800) (← links)
- Corrigendum to: ``A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem'' (Q6162055) (← links)