The following pages link to (Q2753746):
Displaying 12 items.
- A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges (Q298954) (← links)
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (Q703542) (← links)
- Dual-based approximation algorithms for cut-based network connectivity problems (Q722530) (← links)
- Approximating minimum size \{1,2\}-connected networks (Q1861563) (← links)
- The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm (Q2191772) (← links)
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
- A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem (Q2680988) (← links)
- Strongly Connected Spanning Subgraph for Almost Symmetric Networks (Q3132920) (← links)
- Construction of Minimum Power 3-Connected Subgraph with k Backbone Nodes in Wireless Sensor Networks (Q3296835) (← links)
- Approximation algorithms for minimum power k backbone node r-connected subgraph problem in wireless sensor networks (Q5216451) (← links)
- Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges (Q5351864) (← links)
- Computing the 2-blocks of directed graphs (Q5501861) (← links)
