Power optimization for connectivity problems

Mathematics

• Connectivity 84%
• Optimization 70%
• Spanning Subgraph 55%
• Vertex of a graph 39%
• Edge Cover 33%
• Approximation Algorithms 30%
• Wireless multi-hop Networks 22%
• Directed Graph 21%
• Costs 16%
• Graph in graph theory 15%
• Edge-disjoint Paths 15%
• Inapproximability 14%
• NP-hard Problems 12%
• Subgraph 9%
• Polynomial time 9%
• Integer 6%
• Approximation 5%

Engineering & Materials Science

• Approximation algorithms 100%
• Directed graphs 71%
• NP-hard 29%
• Polynomials 23%
• Costs 23%