Approximating minimum cost connectivity problems via uncrossable bifamilies and spider-cover decompositions

Keyphrases

• Spiders 100%
• Connection Problem 100%
• Steiner System 100%
• Minimum Cost 100%
• Cover Decomposition 100%
• K-connected Graph 30%
• Approximation Algorithms 20%
• Node Cost 20%
• Graph Problems 10%
• Network Problems 10%
• Edge Nodes 10%
• Edge-disjoint 10%
• S-node 10%
• Network Matching 10%

Computer Science

• Connectivity Problem 100%
• Connected Subgraph 100%
• Approximation Algorithms 66%
• Subgraphs 33%
• Generalized Node 33%
• Matching Network 33%

Mathematics

• Edge 100%
• Approximability 20%