Approximation algorithms for the unsplittable flow problem

Keyphrases

• Approximation Algorithms 100%
• Unsplittable Flow Problem 100%
• Undirected Graph 66%
• Maximum Demand 66%
• Cmin 66%
• Cmax 66%
• Minimum Capacity 66%
• Large Values 33%
• Expander 33%
• Maximum Degree 33%
• Approximation Ratio 33%
• Number of Vertices 33%
• Constant-factor Approximation Algorithm 33%
• Frieze 33%
• Edge Capacity 33%
• Randomized Rounding 33%
• Constant Degree 33%

Mathematics

• Edge 100%
• Constant Factor 50%
• Expander 50%
• Maximum Degree 50%
• Nonuniform 50%
• Randomized Rounding 50%