Pages that link to "Item:Q2843285"
From MaRDI portal
The following pages link to A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem (Q2843285):
Displaying 4 items.
- Dual-based approximation algorithms for cut-based network connectivity problems (Q722530) (← links)
- Sparse certificates for 2-connectivity in directed graphs (Q1676306) (← links)
- An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph (Q2656340) (← links)
- Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs (Q3452820) (← links)
