Approximating fault-tolerant group-Steiner problems

Keyphrases

• Fault-tolerant 100%
• Steiner Problem 100%
• Approximation Algorithms 66%
• Tight 33%
• Motivation 33%
• Hardness of Approximation 33%
• Edge-connectivity 33%
• Hardness Results 33%
• Vertex Connectivity 33%
• Edge-disjoint Paths 33%
• Steiner System 33%
• Minimum Cost 33%
• Inapproximability Results 33%
• Vertex-disjoint Paths 33%
• Charging Scheme 33%
• Vertex Failures 33%
• Edge Failure 33%

Computer Science

• Fault Tolerant 100%
• Approximation Algorithms 66%
• Vertex Connectivity 33%
• Subgraphs 33%
• Charging Scheme 33%

Mathematics

• Edge 100%
• Edge-Connectivity 25%
• Distinct Vertex 25%