Author

Gary Hoppenworth

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Hardness of Online Directed Steiner Network

This work gives an $\exp\!\bigl(\Omega(\sqrt{\log n})\bigr)$ bound on the competitive ratio, which holds even for randomized algorithms against an oblivious adversary, and on unit-cost DAGs.

Gary Hoppenworth, Yao-Wei Long, S. Mahabadi et al. · 0 citations