Pages that link to "Item:Q868438"

The following pages link to Approximation algorithms for the unsplittable flow problem (Q868438):

Displaying 21 items.

• Optimal interval scheduling with a resource constraint (Q337149) (← links)
• A constant factor approximation algorithm for the storage allocation problem (Q524369) (← links)
• Maximum bipartite flow in networks with adaptive channel width (Q541660) (← links)
• Resource allocation with time intervals (Q606987) (← links)
• Improved algorithms for resource allocation under varying capacity (Q1617284) (← links)
• Complex-demand scheduling problem with application in smart grid (Q1727389) (← links)
• Submodular unsplittable flow on trees (Q1801021) (← links)
• Stochastic makespan minimization in structured set systems (Q2118147) (← links)
• Scheduling split intervals with non-uniform demands (Q2218651) (← links)
• Algebraic theory on shortest paths for all flows (Q2424883) (← 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)
• Scheduling Resources for Throughput Maximization (Q3088087) (← links)
• Submodular Unsplittable Flow on Trees (Q3186514) (← links)
• A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem (Q3448853) (← links)
• Stochastic Unsplittable Flows (Q5002608) (← links)
• Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract) (Q5041742) (← links)
• (Q5075798) (← links)
• (Q5240196) (← links)
• Algebraic Theory on Shortest Paths for All Flows (Q5743545) (← links)