The following pages link to (Q3549697):
Displayed 16 items.
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem (Q494800) (← links)
- Approximating fault-tolerant group-Steiner problems (Q764316) (← links)
- A note on Rooted Survivable Networks (Q990935) (← links)
- Inapproximability of survivable networks (Q1019191) (← links)
- A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems (Q1730018) (← links)
- Black-box reductions for cost-sharing mechanism design (Q1735730) (← links)
- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (Q1749453) (← links)
- Topology design for on-demand dual-path routing in wireless networks (Q1947619) (← links)
- Approximating node-connectivity augmentation problems (Q2429349) (← links)
- An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity (Q3012788) (← links)
- (Q5240415) (← links)
- (Q5743436) (← links)
- (Q5743446) (← links)
- (Q5743494) (← links)
- (Q5874542) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)