1 Search Results for "Piecuch, Krzysztof"


Document
Track A: Algorithms, Complexity and Games
An Optimal Algorithm for Online Multiple Knapsack

Authors: Marcin Bienkowski, Maciej Pacut, and Krzysztof Piecuch

Published in: LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)


Abstract
In the online multiple knapsack problem, an algorithm faces a stream of items, and each item has to be either rejected or stored irrevocably in one of n bins (knapsacks) of equal size. The gain of an algorithm is equal to the sum of sizes of accepted items and the goal is to maximize the total gain. So far, for this natural problem, the best solution was the 0.5-competitive algorithm FirstFit (the result holds for any n ≥ 2). We present the first algorithm that beats this ratio, achieving the competitive ratio of 1/(1+ln(2))-O(1/n) ≈ 0.5906 - O(1/n). Our algorithm is deterministic and optimal up to lower-order terms, as the upper bound of 1/(1+ln(2)) for randomized solutions was given previously by Cygan et al. [TOCS 2016].

Cite as

Marcin Bienkowski, Maciej Pacut, and Krzysztof Piecuch. An Optimal Algorithm for Online Multiple Knapsack. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 13:1-13:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)


Copy BibTex To Clipboard

@InProceedings{bienkowski_et_al:LIPIcs.ICALP.2020.13,
  author =	{Bienkowski, Marcin and Pacut, Maciej and Piecuch, Krzysztof},
  title =	{{An Optimal Algorithm for Online Multiple Knapsack}},
  booktitle =	{47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
  pages =	{13:1--13:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-138-2},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{168},
  editor =	{Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.13},
  URN =		{urn:nbn:de:0030-drops-124207},
  doi =		{10.4230/LIPIcs.ICALP.2020.13},
  annote =	{Keywords: online knapsack, multiple knapsacks, bin packing, competitive analysis}
}
  • Refine by Author
  • 1 Bienkowski, Marcin
  • 1 Pacut, Maciej
  • 1 Piecuch, Krzysztof

  • Refine by Classification
  • 1 Theory of computation → Online algorithms

  • Refine by Keyword
  • 1 bin packing
  • 1 competitive analysis
  • 1 multiple knapsacks
  • 1 online knapsack

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2020

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail