Improved approximation algorithms for minimum power covering problems

Keyphrases

• Approximation Algorithms 100%
• NP-hard Problem 100%
• Covering Problem 100%
• Minimum Power 100%
• Improved Approximation 100%
• Undirected Graph 50%
• Network Design Problem 50%
• Approximation Ratio 50%
• Combinatorial Algorithms 50%
• Wireless Networks 50%
• Maximum Cost 50%
• Minimization Criterion 50%
• Power of a Graph 50%
• Power Minimization 50%
• Edge Cover 50%
• Unit Cost 50%
• Am(III) 50%
• Terminal Backup 50%
• Rounding Method 50%
• Iterative Rounding 50%
• Power Terminal 50%

Computer Science

• Approximation Algorithms 100%
• Approximation Ratio 100%
• Directed Graphs 100%
• Network Design Problem 100%
• Independent Set 100%
• Wireless Network 100%

Mathematics

• Edge 100%
• Covering Problem 100%
• NP-hard Problem 66%
• Incident Edge 66%
• Combinatorial Algorithm 33%
• Independent Set 33%
• Edge Cover 33%
• Unit Costs 33%
• Randomized Rounding 33%