New algorithms for evacuation by 2f+1 agents with at most f crash faults yield competitive ratios at most 7.437 for (3,1), 7.254 for (5,2) and (7,3), 7.147 for (9,4), and asymptotically 4+2√2, while improving the Byzantine search bound to 7.437.
Title resolution pending
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
use method 1representative citing papers
citing papers explorer
-
Search and evacuation with a near majority of faulty agents
New algorithms for evacuation by 2f+1 agents with at most f crash faults yield competitive ratios at most 7.437 for (3,1), 7.254 for (5,2) and (7,3), 7.147 for (9,4), and asymptotically 4+2√2, while improving the Byzantine search bound to 7.437.