Pages that link to "Item:Q5494938"
From MaRDI portal
The following pages link to A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths (Q5494938):
Displaying 12 items.
- A constant factor approximation algorithm for the storage allocation problem (Q524369) (← links)
- Submodular unsplittable flow on trees (Q1801021) (← links)
- An iterative dynamic programming approach for the temporal knapsack problem (Q2030285) (← links)
- General caching is hard: even with small pages (Q2408914) (← links)
- Approximation algorithms for the generalized incremental knapsack problem (Q2687039) (← links)
- Fixed-parameter algorithms for unsplittable flow cover (Q2701069) (← links)
- The Prize-collecting Call Control Problem on Weighted Lines and Rings (Q2798111) (← links)
- Submodular Unsplittable Flow on Trees (Q3186514) (← links)
- A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem (Q3448853) (← links)
- Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation (Q5964827) (← links)
- A knapsack intersection hierarchy (Q6161286) (← links)
- Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem (Q6572832) (← links)
