DROPS

Document

DOI: 10.4230/LIPIcs.ISAAC.2019.10

Online Multidimensional Packing Problems in the Random-Order Model

Authors: David Naori and Danny Raz

Published in: LIPIcs, Volume 149, 30th International Symposium on Algorithms and Computation (ISAAC 2019)

Abstract

We study online multidimensional variants of the generalized assignment problem which are used to model prominent real-world applications, such as the assignment of virtual machines with multiple resource requirements to physical infrastructure in cloud computing. These problems can be seen as an extension of the well known secretary problem and thus the standard online worst-case model cannot provide any performance guarantee. The prevailing model in this case is the random-order model, which provides a useful realistic and robust alternative. Using this model, we study the d-dimensional generalized assignment problem, where we introduce a novel technique that achieves an O(d)-competitive algorithms and prove a matching lower bound of Omega(d). Furthermore, our algorithm improves upon the best-known competitive-ratio for the online (one-dimensional) generalized assignment problem and the online knapsack problem.

Cite as

David Naori and Danny Raz. Online Multidimensional Packing Problems in the Random-Order Model. In 30th International Symposium on Algorithms and Computation (ISAAC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 149, pp. 10:1-10:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{naori_et_al:LIPIcs.ISAAC.2019.10,
  author =	{Naori, David and Raz, Danny},
  title =	{{Online Multidimensional Packing Problems in the Random-Order Model}},
  booktitle =	{30th International Symposium on Algorithms and Computation (ISAAC 2019)},
  pages =	{10:1--10:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-130-6},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{149},
  editor =	{Lu, Pinyan and Zhang, Guochuan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.10},
  URN =		{urn:nbn:de:0030-drops-115067},
  doi =		{10.4230/LIPIcs.ISAAC.2019.10},
  annote =	{Keywords: Random Order, Generalized Assignment Problem, Knapsack Problem, Multidimensional Packing, Secretary Problem}
}

Search Results

Documents authored by Naori, David

Online Multidimensional Packing Problems in the Random-Order Model

Abstract

Cite as

Thanks for your feedback!

Could not send message