Pages that link to "Item:Q4429672"
From MaRDI portal
The following pages link to An Approximation Algorithm for the Minimum-Cost <i>k</i>-Vertex Connected Subgraph (Q4429672):
Displaying 13 items.
- Approximating minimum-cost edge-covers of crossing biset-families (Q397064) (← links)
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem (Q494800) (← links)
- Power optimization for connectivity problems (Q877193) (← links)
- On \(k\)-connectivity problems with sharpened triangle inequality (Q1002105) (← links)
- Approximating minimum-power edge-covers and 2,3-connectivity (Q1026146) (← links)
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
- Approximation algorithms for connected graph factors of minimum weight (Q1743127) (← links)
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems (Q2496319) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity (Q3012788) (← links)
- Approximating Survivable Networks with Minimum Number of Steiner Points (Q3075458) (← links)
- Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems (Q5740195) (← links)
