Approximating minimum power covers of intersecting families and directed connectivity problems

Keyphrases

• Approximation Algorithms 100%
• Connected Spanning Subgraph 33%
• Connection Problem 100%
• Directed Connectivity 100%
• Directed Graph 33%
• Edge Cover 33%
• Edge Set 33%
• Family of Sets 33%
• Graph Problems 33%
• Intersecting Family 100%
• Intersecting Set Families 33%
• K-connected 33%
• Maximum Cost 33%
• Minimization Criterion 33%
• Minimum Power 100%
• Network Connectivity 33%
• Network Design Problem 33%
• Power Cover 100%
• Power Minimization 33%
• Set Covering Problem 33%
• Wireless Networks 33%

Computer Science

• Approximation (Algorithm) 33%
• Approximation Algorithms 100%
• Connectivity Problem 100%
• Directed Graphs 33%
• Network Design Problem 33%
• Subgraphs 33%
• Wireless Networks 33%

Mathematics

• Edge 100%
• Edge Cover 25%
• Network Connectivity 25%