11 Sayan Bhattacharya, Deeparnab Chakrabarty, and Monika Henzinger

URL: https://arxiv · 2025 · arXiv 2511.08485

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it

read on arXiv browse 2 citing papers

citation-role summary

dataset 1

use dataset 1

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

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

cs.DS · 2026-04-03 · unverdicted · novelty 6.0

First experimental study of dynamic greedy set cover algorithms reveals practical tradeoffs in quality and efficiency across real instances.

Showing 2 of 2 citing papers.

Online Steiner Forest with Recourse cs.DS · 2026-05-10 · unverdicted · none · ref 72
An algorithm for online Steiner forest achieves constant competitiveness with amortized O(log n) recourse.
Engineering Algorithms for Dynamic Greedy Set Cover cs.DS · 2026-04-03 · unverdicted · none · ref 7
First experimental study of dynamic greedy set cover algorithms reveals practical tradeoffs in quality and efficiency across real instances.