A new O(2^k)-competitive deterministic algorithm for chasing k-sets in metric spaces that matches the Omega(2^k) lower bound and is optimal against adaptive adversaries.
Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound , journal=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1roles
method 1polarities
extend 1representative citing papers
citing papers explorer
-
Chasing Small Sets Optimally Against Adaptive Adversaries
A new O(2^k)-competitive deterministic algorithm for chasing k-sets in metric spaces that matches the Omega(2^k) lower bound and is optimal against adaptive adversaries.