Power optimization for connectivity problems

Keyphrases

• Approximation Algorithms 100%
• Approximation Guarantee 33%
• Connected Spanning Subgraph 100%
• Connection Problem 100%
• Covering Problem 66%
• Directed Graph 66%
• Edge Cover 66%
• Edge Disjoint Path Problem 33%
• Edge-connected 33%
• Graph Problems 100%
• Inapproximability 33%
• K-edge 66%
• Maximum Cost 33%
• Minimization Criterion 33%
• NP-hard Problem 33%
• Power Minimization 33%
• Power Optimization 100%
• Quasi-polynomial Time 33%
• Wireless multi-hop Networks 33%

Computer Science

• Approximation (Algorithm) 25%
• Approximation Algorithms 75%
• Connectivity Problem 100%
• Directed Graphs 50%
• Fundamental Problem 25%
• multihop wireless network 25%
• Polynomial Time 25%
• Power Optimization 100%
• Subgraphs 100%

Mathematics

• Edge 100%
• Edge Cover 50%
• Integer 25%
• NP-hard Problem 25%
• Path Problem 25%
• Polynomial Time 25%