The following pages link to (Q2762522):
Displaying 7 items.
- A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges (Q298954) (← links)
- An approximation algorithm for minimum-cost vertex-connectivity problems (Q679445) (← links)
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (Q703542) (← links)
- Finding 2-edge connected spanning subgraphs. (Q1426722) (← links)
- Approximating minimum size \{1,2\}-connected networks (Q1861563) (← links)
- A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem (Q2680988) (← links)
- Color-avoiding connected spanning subgraphs with minimum number of edges (Q6130205) (← links)