Pages that link to "Item:Q5383962"
From MaRDI portal
The following pages link to A Mazing 2+<i>∊</i> Approximation for Unsplittable Flow on a Path (Q5383962):
Displayed 14 items.
- A constant factor approximation algorithm for the storage allocation problem (Q524369) (← links)
- Improved algorithms for resource allocation under varying capacity (Q1617284) (← links)
- Complex-demand scheduling problem with application in smart grid (Q1727389) (← links)
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions (Q1751090) (← links)
- Submodular unsplittable flow on trees (Q1801021) (← links)
- Scheduling split intervals with non-uniform demands (Q2218651) (← links)
- General caching is hard: even with small pages (Q2408914) (← 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)
- A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem (Q3448853) (← links)
- Resource allocation problem under single resource assignment (Q4553878) (← links)
- Improved Algorithm for Resource Allocation Problems (Q4604919) (← links)
- Stochastic Unsplittable Flows (Q5002608) (← links)
- (Q5075798) (← links)