Online Submodular Maximization Problem with Vector Packing Constraint

T-H. Hubert Chan, Shaofeng H. -C. Jiang, Zhihao Gavin Tang +1

We consider the online vector packing problem in which we have a $d$ dimensional knapsack and items $u$ with weight vectors ${\mathbf{w}}_u\in {\mathbb{R}}_{+}^d$ arrive online in an ar…