Algorithmic aspects of bandwidth trading
From MaRDI portal
Publication:2944546
DOI10.1145/1186810.1186820zbMath1321.68115OpenAlexW2047220011MaRDI QIDQ2944546
Ari Freund, Joseph (Seffi) Naor, Randeep Bhatia, Julia Chuzhoy
Publication date: 2 September 2015
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1186810.1186820
schedulingresource allocationdynamic storage allocationapproximation algorithms for NP-hard problemsgeneral caching
Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (3)
Real-time scheduling to minimize machine busy times ⋮ Scheduling split intervals with non-uniform demands ⋮ Minimizing total busy time in parallel scheduling with application to optical networks
This page was built for publication: Algorithmic aspects of bandwidth trading
