On network design problems: Fixed cost flows and the covering steiner problem

Keyphrases

• Network Design Problem 100%
• Steiner Problem 100%
• Fixed Costs 100%
• Flow Cost 100%
• Infinite Capacity 100%
• Flow Problems 62%
• Approximation Algorithms 37%
• Steiner Tree Problem 37%
• Directed Graph 37%
• Total Flow 37%
• Undirected Graph 25%
• Randomized Algorithms 12%
• Bicriteria Approximation 12%
• Best Ratio 12%
• Connection Problem 12%
• Hardness Results 12%
• Point-to-point Connections 12%
• One-round 12%
• SIMPLE Algorithm 12%
• Prover 12%
• K-MST 12%
• Randomized Reductions 12%
• Optimal Flow 12%
• Generalized Steiner Tree 12%
• Charge Flow 12%
• Fixed Charge 12%

Computer Science

• Network Design Problem 100%
• Infinite Capacity 100%
• Directed Graphs 62%
• Approximation Algorithms 50%
• Steiner Tree Problem 37%
• Approximation Ratio 12%
• Simple Algorithm 12%
• Point Connection 12%
• Connection Problem 12%
• Minimum Spanning Tree 12%

Mathematics

• Fixed Costs 100%
• Infinite Capacity 100%
• Edge 75%
• Tree Problem 37%
• Running Time 12%
• Minimum Spanning Tree 12%