Cited in
(7)- On the approximability of unsplittable flow on a path with time windows
- Approximating the maximum independent set of convex polygons with a bounded number of directions
- Approximation algorithms for round-UFP and round-SAP
- Improved polynomial-time approximations for clustering with minimum sum of radii or diameters
- The parameterized complexity landscape of the unsplittable flow problem
- Approximation algorithms for clustering with minimum sum of radii, diameters, and squared radii
- Unsplittable flow on a short path
This page was built for publication: Unsplittable flow on a path: the game!
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575112)
