A (1 + ϵ)-approximation for Unsplittable Flow on a Path in fixed-parameter running time

Keyphrases

• Fixed Parameter 100%
• Unsplittable Flow on a Path 100%
• Polynomial Time 50%
• Log-log 50%
• Caching 50%
• Algorithm Parameters 50%
• Dynamic Programming 50%
• Programming Framework 50%
• Approximation Algorithms 50%
• Bandwidth Allocation 50%
• 2-approximation 50%
• Fixed-parameter Tractability 50%
• Fixed-parameter Algorithms 50%
• QPTAS 50%
• End Vertex 50%
• EPTAS 50%
• Unweighting 50%
• Edge Capacity 50%
• Allocation Scheduling 50%

Computer Science

• Approximation (Algorithm) 100%
• Dynamic Programming 33%
• Approximation Algorithms 33%
• Programming Framework 33%
• Bandwidth Allocation 33%
• Polynomial Time 33%

Mathematics

• Edge 100%
• Running Time 100%
• Polynomial Time 25%