Online submodular maximization problem with vector packing constraint

T. H.Hubert Chan, Shaofeng H.C. Jiang, Zhihao Gavin Tang, Xiaowei Wu

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

2 Citations (Scopus)

Abstract

We consider the online vector packing problem in which we have a d dimensional knapsack and items u with weight vectors wu ϵ Rd+ arrive online in an arbitrary order. Upon the arrival of an item, the algorithm must decide immediately whether to discard or accept the item into the knapsack. When item u is accepted, wu(i) units of capacity on dimension i will be taken up, for each i ϵ [d]. To satisfy the knapsack constraint, an accepted item can be later disposed of with no cost, but discarded or disposed of items cannot be recovered. The objective is to maximize the utility of the accepted items S at the end of the algorithm, which is given by f(S) for some non-negative monotone submodular function f. For any small constant ϵ > 0, we consider the special case that the weight of an item on every dimension is at most a (1 - ϵ) fraction of the total capacity, and give a polynomial-Time deterministic O( k /ϵ2 )-competitive algorithm for the problem, where k is the (column) sparsity of the weight vectors. We also show several (almost) tight hardness results even when the algorithm is computationally unbounded. We first show that under the ϵ-slack assumption, no deterministic algorithm can obtain any o(k) competitive ratio, and no randomized algorithm can obtain any o( k/log k ) competitive ratio. We then show that for the general case (when ϵ = 0), no randomized algorithm can obtain any o(k) competitive ratio. In contrast to the (1 + δ) competitive ratio achieved in Kesselheim et al. (STOC 2014) for the problem with random arrival order of items and under large capacity assumption, we show that in the arbitrary arrival order case, even when ∥wu∥∞ is arbitrarily small for all items u, it is impossible to achieve any o( log k log log k ) competitive ratio.

Original languageEnglish
Title of host publication25th European Symposium on Algorithms, ESA 2017
EditorsChristian Sohler, Christian Sohler, Kirk Pruhs
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770491
DOIs
Publication statusPublished - 1 Sep 2017
MoE publication typeA4 Article in a conference publication
EventEuropean Symposium on Algorithms - Vienna, Austria
Duration: 4 Sep 20176 Sep 2017
Conference number: 25

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume87
ISSN (Print)1868-8969

Conference

ConferenceEuropean Symposium on Algorithms
Abbreviated titleESA
CountryAustria
CityVienna
Period04/09/201706/09/2017

Keywords

  • Free-disposal
  • Submodular maximization
  • Vector packing

Fingerprint Dive into the research topics of 'Online submodular maximization problem with vector packing constraint'. Together they form a unique fingerprint.

Cite this