Pages that link to "Item:Q2496319"

The following pages link to Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems (Q2496319):

Displayed 10 items.

• Survivable network activation problems (Q386909) ‎ (← links)
• Degree constrained node-connectivity problems (Q486998) ‎ (← 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)
• A primal-dual approximation algorithm for the survivable network design problem in hypergraphs (Q1861578) ‎ (← links)
• Pruning 2-connected graphs (Q2428662) ‎ (← links)
• Approximating node-connectivity augmentation problems (Q2429349) ‎ (← 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)