Pages that link to "Item:Q3189033"

The following pages link to An improved approximation algorithm for resource allocation (Q3189033):

Displaying 20 items.

• Improved algorithmic results for unsplittable stable allocation problems (Q326457) (← links)
• Real-time scheduling to minimize machine busy times (Q906551) (← links)
• An efficient algorithm for the parametric resource allocation problem (Q1058467) (← links)
• Flexible bandwidth assignment with application to optical networks (Q1617285) (← links)
• A population-based fast algorithm for a billion-dimensional resource allocation problem with integer variables (Q1753593) (← links)
• Submodular unsplittable flow on trees (Q1801021) (← links)
• Flexible resource allocation to interval jobs (Q1999968) (← links)
• Approximation algorithms for the ring loading problem with penalty cost (Q2350601) (← links)
• Approximation algorithms for a virtual machine allocation problem with finite types (Q2680235) (← links)
• Improved algorithms for scheduling unsplittable flows on paths (Q2684488) (← links)
• Approximation algorithms for the generalized incremental knapsack problem (Q2687039) (← links)
• The prize-collecting call control problem on weighted lines and rings (Q2798111) (← links)
• New Approximation Results for Resource Replication Problems (Q3167398) (← links)
• Submodular Unsplittable Flow on Trees (Q3186514) (← links)
• A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem (Q3448853) (← links)
• Improved Approximation Algorithms for Budgeted Allocations (Q3521918) (← links)
• Stochastic Unsplittable Flows (Q5002608) (← links)
• (Q5136269) (← links)
• A logarithmic approximation for unsplittable flow on line graphs (Q5501955) (← links)
• The preemptive resource allocation problem (Q6547132) (← links)