The following pages link to (Q3840352):
Displaying 9 items.
- A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs (Q284336) (← links)
- Finding 2-edge connected spanning subgraphs. (Q1426722) (← links)
- Approximating minimum size \{1,2\}-connected networks (Q1861563) (← links)
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree (Q1861569) (← links)
- Approximating minimum-cost connected \(T\)-joins (Q2345942) (← links)
- A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem (Q2680988) (← links)
- Improving on the 1. 5-approximation of a smallest 2-edge connected spanning subgraph (Q2706198) (← 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)