Hardness of approximation for vertex-connectivity network-design problems

Keyphrases

• Hardness of Approximation 100%
• Network Design Problem 100%
• Vertex Connectivity 100%
• Network Connectivity 100%
• Number of Vertices 33%
• Graph Problems 33%
• Connectivity Augmentation Problem 33%
• Minimum Cost 33%
• Vertex-disjoint Paths 33%
• Connected Spanning Subgraph 33%
• Survivable Network Design Problem 33%
• Approximation Results 33%
• Efficient Formula 33%

Computer Science

• Vertex Connectivity 100%
• Network Design Problem 100%
• Approximation (Algorithm) 100%
• Subgraphs 66%
• Approximation Ratio 33%
• Constant Factor 33%

Mathematics

• Edge 100%
• Approximability 100%
• Constant Factor 100%
• Network Connectivity 100%