Approximating node connectivity problems via set covers

Mathematics

• Set Cover 100%
• Connectivity 71%
• Approximation Algorithms 69%
• Costs 51%
• Vertex of a graph 44%
• Undirected Graph 37%
• Directed Graph 22%
• Metric 20%
• Subgraph 13%
• Spanning Subgraph 9%
• Disjoint Paths 9%
• Approximation 8%
• Requirements 6%
• Range of data 4%
• Generalise 4%
• Integer 4%
• Arbitrary 4%

Engineering & Materials Science

• Approximation algorithms 85%
• Directed graphs 27%
• Costs 27%