Pages that link to "Item:Q5501955"
From MaRDI portal
The following pages link to A logarithmic approximation for unsplittable flow on line graphs (Q5501955):
Displayed 11 items.
- Optimal interval scheduling with a resource constraint (Q337149) (← links)
- A constant factor approximation algorithm for the storage allocation problem (Q524369) (← links)
- On the complexity of interval scheduling with a resource constraint (Q551193) (← links)
- Caching is hard -- even in the fault model (Q692624) (← links)
- Improved algorithms for resource allocation under varying capacity (Q1617284) (← links)
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions (Q1751090) (← links)
- Approximations for generalized unsplittable flow on paths with application to power systems optimization (Q2678593) (← links)
- Pricing on Paths: A PTAS for the Highway Problem (Q2796210) (← links)
- The Prize-collecting Call Control Problem on Weighted Lines and Rings (Q2798111) (← links)
- (Q5136269) (← links)
- A logarithmic approximation for unsplittable flow on line graphs (Q5501955) (← links)