Skip to content

Author

Jakub Tarnawski

We have 5 of 11 papers

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 Nov 2026

Tight Bounds for Sublinear Metric Steiner Tree

In the metric Steiner tree problem we are given an $n$-point metric space $(V,w)$ and a set $T\subseteq V$ of terminals, and we seek the smallest weight $\mathrm{OPT}$ of a tree that spans $T$ and may use points of $V\setminus T$. We study sublinear algorithms in the distance-oracle model, where the algorithm knows $V$...

S. Mahabadi, M. Roghani, Jakub Tarnawski et al. · 0 citations
Preprint Oct 2026

A Better Lower Bound for Sublinear Metric Steiner Tree

In the metric Steiner tree problem, we are given an $n$-point metric space $(V,w)$ and a set of terminals $T\subseteq V$, and we are interested in the smallest total weight $\mathsf{st}(V,T,w)$ of a tree that contains every terminal and may also use points of $V\setminus T$. We work in the distance-oracle model: the al...

S. Mahabadi, Jakub Tarnawski, A. Vakilian · 0 citations
#edge computing Preprint Nov 2026

Semi-Streaming Reachability and Shortest Paths in $n^{1/3+o(1)}$ Passes

In the semi-streaming model, the edges of an $n$-vertex graph arrive in a stream, and an algorithm makes multiple passes over that stream while using only $\widetilde{O}(n)$ space. The number of passes needed to compute single-source reachability in directed graphs is a long-standing open question in streaming algorith...

Gary Hoppenworth, George Z. Li, S. Mahabadi et al. · 0 citations
Preprint Oct 2026

Improved Sublinear Algorithms for Maximal Independent Set and Metric Steiner Forest

This work gives an algorithm that estimates the size of an MIS up to a multiplicative factor of $(1+\eps)$ using $\tO(n^{4/3}/\eps^2)$ queries and provides an algorithm with $\tO(n)$ query complexity that is very simple and does not proceed via MIS.

S. Mahabadi, Jakub Tarnawski · 1 citation · ⚡1
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

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.