On Fixed Cost k-Flow Problems

Keyphrases

• Flow Problems 100%
• Fixed Costs 100%
• Capacitated 40%
• Minimum Cost 40%
• Group Steiner Tree 40%
• Multicommodity Flow 20%
• Approximation Scheme 20%
• Undirected Graph 20%
• Approximation Algorithms 20%
• Negative Charge 20%
• Steiner Tree Problem 20%
• Minimum Size 20%
• Connected Component 20%
• Edge-disjoint Paths 20%
• Steiner System 20%
• Spanning Subgraph 20%
• Steiner Forest 20%
• Logarithmic Approximation 20%
• Steiner Tree 20%
• Optimum Size 20%
• Steiner Point 20%
• Minimum Capacity 20%
• Bipartite Graph 20%
• Shift Design 20%
• Point-to-point Connections 20%
• Multi-commodity Flow Problem 20%
• Edge Capacity 20%
• Practical Project 20%
• Rent or Buy 20%
• Source-sink 20%
• Approximate Reduction 20%

Computer Science

• Approximation (Algorithm) 100%
• Subgraphs 100%
• steiner tree 100%
• Approximation Algorithms 50%
• approximation scheme 50%
• Directed Graphs 50%
• Connected Component 50%
• Logarithmic Approximation 50%
• Bipartite Graph 50%
• Steiner Tree Problem 50%
• Point Connection 50%
• Negative Charge 50%

Mathematics

• Fixed Costs 100%
• Edge 80%
• Integer 60%
• Bipartite Graph 20%
• Group Steiner Tree Problem 20%
• Connected Component 20%