Online server allocation in a server farm via benefit task systems

DOI10.1145/380752.380849zbMath1323.68020OpenAlexW2063801913MaRDI QIDQ5176012

Baruch Schieber, T. S. Jayram, M. I. Sviridenko, Robert Krauthgamer, Tracy Kimbrel

Publication date: 27 February 2015

Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Internet topics (68M11)

Cites Work

• A constant-factor approximation algorithm for the k -median problem (extended abstract)

This page was built for publication: Online server allocation in a server farm via benefit task systems