An $O(\sqrt{k})$-Approximation Algorithm for Minimum Power k Edge Disjoint st-Paths.

Keyphrases

• Approximation Algorithms 100%
• Minimum Power 100%
• K-edge 100%
• Edge-disjoint 100%
• Sqrt 100%
• Undirected Graph 33%
• Network Design Problem 33%
• Approximation Ratio 33%
• Edge Set 33%
• Unit Cost 33%
• General Costs 33%
• Path Problems 33%
• Power Networks Design 33%

Computer Science

• Approximation Algorithms 100%
• Approximation Ratio 33%
• Directed Graphs 33%
• Network Design Problem 33%

Mathematics

• Edge 100%
• Open Question 20%
• Unit Costs 20%
• Path Problem 20%