Pages that link to "Item:Q2496319"
From MaRDI portal
The following pages link to Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems (Q2496319):
Displayed 33 items.
- Improved approximation algorithms for single-tiered relay placement (Q266064) (← links)
- Survivable network activation problems (Q386909) (← links)
- Degree constrained node-connectivity problems (Q486998) (← links)
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem (Q494800) (← links)
- A unified algorithm for degree bounded survivable network design (Q896300) (← 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)
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
- Black-box reductions for cost-sharing mechanism design (Q1735730) (← links)
- Approximating Steiner trees and forests with minimum number of Steiner points (Q1796259) (← links)
- Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems (Q1799605) (← links)
- A primal-dual approximation algorithm for the survivable network design problem in hypergraphs (Q1861578) (← links)
- Approximation algorithms for connectivity augmentation problems (Q2117100) (← links)
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
- Relay placement for two-connectivity (Q2339829) (← links)
- Approximability of capacitated network design (Q2354026) (← links)
- Pruning 2-connected graphs (Q2428662) (← links)
- Approximating node-connectivity augmentation problems (Q2429349) (← links)
- Approximating the Generalized Terminal Backup Problem via Half-Integral Multiflow Relaxation (Q2804546) (← links)
- Half-integrality, LP-branching, and FPT Algorithms (Q2816829) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- Approximability of Capacitated Network Design (Q3009752) (← links)
- Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands (Q3010423) (← links)
- An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity (Q3012788) (← links)
- On Element-Connectivity Preserving Graph Simplification (Q3452796) (← links)
- (Q5240415) (← links)
- Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal (Q5501947) (← links)
- Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems (Q5740195) (← links)
- (Q5743446) (← links)
- Node-Connectivity Terminal Backup, Separately Capacitated Multiflow, and Discrete Convexity (Q5883291) (← links)
- A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem (Q5963614) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
- On a partition LP relaxation for min-cost 2-node connected spanning subgraphs (Q6106538) (← links)