Approximating minimum-cost connectivity problems via uncrossable bifamilies

Keyphrases

• Connection Problem 100%
• Minimum Cost 100%
• Survivable Networks 100%
• Approximation Algorithms 20%
• Graph Problems 20%
• Node Cost 20%
• Edge-connectivity 20%
• Node Connectivity 20%
• Network Problems 20%
• K-connected Graph 20%
• Edge Nodes 20%
• Element Connectivity 20%
• Edge-disjoint 20%
• S-node 20%

Computer Science

• Approximation Algorithms 100%
• Connectivity Node 100%
• Connectivity Problem 100%
• Connected Subgraph 100%
• Subgraphs 100%