A deterministic O(m)-competitive algorithm for parametrized MSS on weighted stars is tight, and improved lower bounds on HSTs rule out constant-competitive algorithms for m≥4.
Parametrized Metrical Task Systems , booktitle =
1 Pith paper cite this work, alongside 1 external citations. Polarity classification is still indexing.
1
Pith paper citing it
1
external citations · OpenAlex
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Improved Algorithms and Lower Bounds for Parametrized Metrical Service Systems
A deterministic O(m)-competitive algorithm for parametrized MSS on weighted stars is tight, and improved lower bounds on HSTs rule out constant-competitive algorithms for m≥4.