Abstract
AbstractProblems involving the efficient arrangement of simple objects, as captured by bin packing and makespan scheduling, are fundamental tasks in combinatorial optimization. These are well understood in the traditional online and offline cases, but have been less well-studied when the volume of the input is truly massive, and cannot even be read into memory. This is captured by the streaming model of computation, where the aim is to approximate the cost of the solution in one pass over the data, using small space. As a result, streaming algorithms produce concise input summaries that approximately preserve the optimum value. We design the first efficient streaming algorithms for these fundamental problems in combinatorial optimization. For Bin Packing, we provide a streaming asymptotic (1 + ε)-approximation with $\widetilde {O}$
O
~
$\left (\frac {1}{\varepsilon }\right )$
1
ε
, where $\widetilde {{{O}}}$
O
~
hides logarithmic factors. Moreover, such a space bound is essentially optimal. Our algorithm implies a streaming (d + ε)-approximation for Vector Bin Packing in d dimensions, running in space $\widetilde {{{O}}}\left (\frac {d}{\varepsilon }\right )$
O
~
d
ε
. For the related Vector Scheduling problem, we show how to construct an input summary in space $\widetilde {{{O}}}(d^{2}\cdot m / \varepsilon ^{2})$
O
~
(
d
2
⋅
m
/
ε
2
)
that preserves the optimum value up to a factor of $2 - \frac {1}{m} +\varepsilon $
2
−
1
m
+
ε
, where m is the number of identical machines.
Funder
H2020 European Research Council
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference41 articles.
1. Albers, S.: Better bounds for online scheduling. SIAM J. Comput. 29(2), 459–473 (1999)
2. Applegate, D., Buriol, L.S., Dillard, B.L., Johnson, D.S., Shor, P.W.: The cutting-stock approach to bin packing: theory and experiments. In: ALENEX, vol. 3, pp 1–15 (2003)
3. Azar, Y., Cohen, I.R., Kamara, S., Shepherd, B.: Tight bounds for online vector bin packing. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC ’13 ACM, pp 961–970 (2013)
4. Azar, Y., Cohen, I.R., Panigrahi, D.: Randomized algorithms for online vector load balancing. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’18 SIAM, pp 980–991 (2018)
5. Balogh, J., Békési, J., Dósa, G., Epstein, L., Levin, A.: A new and improved algorithm for online bin packing. In: 26th Annual European Symposium on Algorithms (ESA 2018), of LIPIcs. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, vol. 112 , pp 5:1–5:14 (2018)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献