2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS) , pages =

Bosek, Bartlomiej, Leniowski, Dariusz, Sankowski, Piotr, Zych, Anna , title = · 2014 · DOI 10.1109/focs.2014.48

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

open at publisher browse 1 citing papers

representative citing papers

cs.DS · 2026-05-10 · unverdicted · novelty 8.0

An algorithm for online Steiner forest achieves constant competitiveness with amortized O(log n) recourse.

Showing 1 of 1 citing paper.

Online Steiner Forest with Recourse cs.DS · 2026-05-10 · unverdicted · none · ref 41
An algorithm for online Steiner forest achieves constant competitiveness with amortized O(log n) recourse.