Presents O(d)-competitive algorithms for d-dimensional online GAP in random-order model with matching lower bound, improving prior 1D results.
Primal beats dual on online packing lps in the random-order model
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Online Multidimensional Packing Problems in the Random-Order Model
Presents O(d)-competitive algorithms for d-dimensional online GAP in random-order model with matching lower bound, improving prior 1D results.