An algorithm for online Steiner forest achieves constant competitiveness with amortized O(log n) recourse.
and Parotsidis, Nikos and Saulpic, David and Schwiegelshohn, Chris , title =
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 Steiner Forest with Recourse
An algorithm for online Steiner forest achieves constant competitiveness with amortized O(log n) recourse.