Pages that link to "Item:Q5171193"
From MaRDI portal
The following pages link to An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design (Q5171193):
Displaying 16 items.
- Degree constrained node-connectivity problems (Q486998) (← links)
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem (Q494800) (← links)
- Approximating source location and star survivable network problems (Q528470) (← links)
- Approximating survivable networks with \(\beta \)-metric costs (Q553954) (← links)
- A note on labeling schemes for graph connectivity (Q763487) (← links)
- Approximating fault-tolerant group-Steiner problems (Q764316) (← links)
- Simpler analysis of LP extreme points for traveling salesman and survivable network design problems (Q974982) (← links)
- A note on Rooted Survivable Networks (Q990935) (← links)
- Black-box reductions for cost-sharing mechanism design (Q1735730) (← links)
- Approximating subset \(k\)-connectivity problems (Q2376789) (← links)
- Approximating node-connectivity augmentation problems (Q2429349) (← links)
- Approximating Source Location and Star Survivable Network Problems (Q2827812) (← links)
- Approximability of Capacitated Network Design (Q3009752) (← links)
- An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity (Q3012788) (← links)
- Approximating Survivable Networks with Minimum Number of Steiner Points (Q3075458) (← links)
- (Q5874542) (← links)
