Approximating rooted connectivity augmentation problems

Mathematics

• Augmentation 100%
• Connectivity 76%
• Subset 26%
• Undirected Graph 22%
• Graph in graph theory 22%
• Approximation Algorithms 21%
• Set Cover 15%
• Disjoint Paths 14%
• Vertex of a graph 13%
• Polynomial Algorithm 13%
• Directed Graph 11%
• NP-complete problem 9%
• Lower bound 7%
• Integer 6%
• Approximation 6%

Engineering & Materials Science

• Approximation algorithms 91%
• Directed graphs 49%
• NP-hard 40%
• Polynomials 32%