Pages that link to "Item:Q679445"
From MaRDI portal
The following pages link to An approximation algorithm for minimum-cost vertex-connectivity problems (Q679445):
Displaying 13 items.
- Approximating minimum-cost edge-covers of crossing biset-families (Q397064) (← links)
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633) (← links)
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem (Q494800) (← links)
- Faster approximation algorithms for weighted triconnectivity augmentation problems (Q1267191) (← links)
- On the minimum local-vertex-connectivity augmentation in graphs (Q1406041) (← links)
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
- Approximating minimum size \{1,2\}-connected networks (Q1861563) (← links)
- A primal-dual approximation algorithm for the survivable network design problem in hypergraphs (Q1861578) (← links)
- Approximation algorithms for connectivity augmentation problems (Q2117100) (← links)
- Approximating node-connectivity augmentation problems (Q2429349) (← links)
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems (Q2496319) (← links)
- An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity (Q3012788) (← links)
- Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems (Q5740195) (← links)
