The following pages link to (Q4411277):
Displaying 17 items.
- The \(k\)-splittable flow problem (Q818654) (← links)
- Approximation algorithms for the unsplittable flow problem (Q868438) (← links)
- Resource allocation in bounded degree trees (Q1024215) (← links)
- A fixed-parameter tractability result for multicommodity demand flow in trees (Q1045910) (← links)
- On the single-source unsplittable flow problem (Q1125608) (← links)
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions (Q1751090) (← links)
- NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow (Q2464420) (← links)
- Combinatorial algorithms for the unsplittable flow problem (Q2492628) (← links)
- Meet and merge: approximation algorithms for confluent flows (Q2495396) (← links)
- Combinatorial approximation algorithms for generalized flow problems (Q2709797) (← links)
- A near-linear time constant factor algorithm for unsplittable flow problem on line with bag constraints (Q2908848) (← links)
- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs (Q3638868) (← links)
- (Q4633882) (← links)
- (Q5136269) (← links)
- Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow (Q5450805) (← links)
- A logarithmic approximation for unsplittable flow on line graphs (Q5501955) (← links)
- A knapsack intersection hierarchy (Q6161286) (← links)