On minimum power connectivity problems

Mathematics

• Connectivity 100%
• Vertex of a graph 62%
• Undirected Graph 51%
• Directed Graph 51%
• Approximation Algorithms 48%
• Costs 40%
• Wireless Networks 37%
• Inapproximability 34%
• Network Design 34%
• Edge-connectivity 33%
• Disjoint Paths 32%
• Polynomial Algorithm 30%
• Polynomial Approximation 28%
• Logarithmic 23%
• Subgraph 22%
• Approximation 13%
• Graph in graph theory 12%