Approximating fault-tolerant group-Steiner problems

Mathematics

• Steiner's problem 100%
• Fault-tolerant 89%
• Vertex of a graph 40%
• Costs 34%
• Approximation Algorithms 20%
• Steiner network 18%
• Roots 17%
• Vertex Connectivity 15%
• Inapproximability 14%
• Edge-connectivity 14%
• Disjoint Paths 13%
• Hardness 11%
• Connectivity 10%
• Subgraph 9%
• Lemma 9%
• Distinct 8%
• Subset 6%
• Graph in graph theory 5%

Engineering & Materials Science

• Approximation algorithms 38%
• Costs 26%
• Hardness 13%