Pages that link to "Item:Q2896372"
From MaRDI portal
The following pages link to Approximating Subset k-Connectivity Problems (Q2896372):
Displaying 8 items.
- Approximating minimum-cost edge-covers of crossing biset-families (Q397064) (← links)
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- Approximating \(k\)-connected \(m\)-dominating sets (Q2144267) (← links)
- Physical ZKP for connected spanning subgraph: applications to bridges puzzle and other problems (Q2152094) (← links)
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
- Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching (Q4507363) (← links)
- Approximation Algorithms and Hardness Results for Labeled Connectivity Problems (Q5756701) (← links)
- Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)
