The following pages link to (Q3140408):
Displaying 9 items.
- On finding a biconnected spanning planar subgraph with applications to the facilities layout problem (Q1278276) (← links)
- Finding 2-edge connected spanning subgraphs. (Q1426722) (← links)
- Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH (Q1430177) (← links)
- Approximating unweighted connectivity problems in parallel (Q1854474) (← links)
- Approximating minimum size \{1,2\}-connected networks (Q1861563) (← links)
- Approximating the smallest 2-vertex connected spanning subgraph of a directed graph (Q2286744) (← links)
- Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges (Q5351864) (← links)
- A polyhedral approach to planar augmentation and related problems (Q6102325) (← links)
- Towards more precise parallel biconnectivity approximation (Q6487442) (← links)
