Pages that link to "Item:Q1019191"

The following pages link to Inapproximability of survivable networks (Q1019191):

Displaying 10 items.

• Approximating minimum-cost edge-covers of crossing biset-families (Q397064) (← links)
• Approximating survivable networks with \(\beta \)-metric costs (Q553954) (← links)
• Approximating fault-tolerant group-Steiner problems (Q764316) (← links)
• A note on Rooted Survivable Networks (Q990935) (← links)
• Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
• On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
• A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
• Approximating subset \(k\)-connectivity problems (Q2376789) (← links)
• Approximating node-connectivity augmentation problems (Q2429349) (← links)
• On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q6200809) (← links)