Packing Small Vectors
From MaRDI portal
Publication:4575687
DOI10.1137/1.9781611974331.CH103zbMath1409.68052OpenAlexW4248316170MaRDI QIDQ4575687
Ilan Reuven Cohen, Alan Roytman, Yossi Azar, Amos Fiat
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/13d04c5a6900bc202e97ff60ce329a46d3948305
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items (9)
Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Open-end bin packing: new and old analysis approaches ⋮ Online bin packing with cardinality constraints resolved ⋮ Online two-dimensional vector packing with advice ⋮ Several methods of analysis for cardinality constrained bin packing ⋮ Unnamed Item ⋮ Lower bounds for online bin covering-type problems ⋮ Online Submodular Maximization Problem with Vector Packing Constraint. ⋮ Several methods of analysis for cardinality constrained bin packing
This page was built for publication: Packing Small Vectors
