An algorithm for online Steiner forest achieves constant competitiveness with amortized O(log n) recourse.
Proceedings of the 2025 ACM-SIAM Symposium on Discrete Algorithms (SODA '25) , pages =
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
-
Online Steiner Forest with Recourse
An algorithm for online Steiner forest achieves constant competitiveness with amortized O(log n) recourse.