Pages that link to "Item:Q2117701"
From MaRDI portal
The following pages link to 2-node-connectivity network design (Q2117701):
Displaying 11 items.
- Approximation algorithms for vertex-connectivity augmentation on the cycle (Q2085731) (← links)
- Approximating \(k\)-connected \(m\)-dominating sets (Q2144267) (← links)
- A polylogarithmic approximation algorithm for 2-edge-connected dominating set (Q2234806) (← links)
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- (Q3780901) (← links)
- Node connectivity augmentation via iterative randomized rounding (Q6038664) (← links)
- On a partition LP relaxation for min-cost 2-node connected spanning subgraphs (Q6106538) (← links)
- 2-node-connectivity network design (Q6122594) (← links)
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (Q6156028) (← links)
- Approximation algorithms for node and element connectivity augmentation problems (Q6635706) (← links)