An improved approximation algorithm for resource allocation

DOI10.1145/2000807.2000816zbMath1295.68209OpenAlexW1996971123MaRDI QIDQ3189033

Yuval Rabani, Amit Chakrabarti, Gruia Călinescu, Howard J. Karloff

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2000807.2000816

zbMATH Keywords

approximation algorithmcall admission controlresource allocation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Multi-objective and goal programming (90C29) Inventory, storage, reservoirs (90B05) Approximation algorithms (68W25)

Related Items (13)

Flexible bandwidth assignment with application to optical networks ⋮ A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem ⋮ Submodular Unsplittable Flow on Trees ⋮ Improved algorithms for scheduling unsplittable flows on paths ⋮ Approximation algorithms for the generalized incremental knapsack problem ⋮ Real-time scheduling to minimize machine busy times ⋮ Stochastic Unsplittable Flows ⋮ Flexible resource allocation to interval jobs ⋮ The Prize-collecting Call Control Problem on Weighted Lines and Rings ⋮ Submodular unsplittable flow on trees ⋮ Unnamed Item ⋮ A logarithmic approximation for unsplittable flow on line graphs ⋮ Approximation algorithms for the ring loading problem with penalty cost

This page was built for publication: An improved approximation algorithm for resource allocation