Approximating rooted connectivity augmentation problems

Keyphrases

• Connectivity Augmentation Problem 100%
• Rooted Connectivity 100%
• Undirected Graph 33%
• Approximation Algorithms 33%
• K-connected 16%
• Internally Disjoint Paths 16%
• Polynomial-time Algorithm 16%
• Directed Graph 16%
• NP-hard 16%
• Small Sets 16%
• Polynomially Solvable 16%
• Set Covering Problem 16%
• Approximation Guarantee 16%
• Better Approximation 16%
• U-set 16%

Mathematics

• Edge 100%
• Integer 50%
• Polynomial 50%
• Small Set 50%

Computer Science

• Directed Graphs 100%
• Approximation Algorithms 66%
• Polynomial Algorithm 33%
• Approximation (Algorithm) 33%