Settles deterministic competitive ratio (up to constants) for MPMD-Size via reduction to metrical task systems on 2^{n-1} points and gives O(1)-competitive deterministic algorithm for polynomial convex delays with f'(0)>0 on uniform metrics.
19 Ngoc Mai Le, Seeun William Umboh, and Ningyuan Xie
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Online Matching with Size-Based and Convex Delays
Settles deterministic competitive ratio (up to constants) for MPMD-Size via reduction to metrical task systems on 2^{n-1} points and gives O(1)-competitive deterministic algorithm for polynomial convex delays with f'(0)>0 on uniform metrics.