Tight Bounds for Sublinear Metric Steiner Tree
cs.DS
Submitted: 2026-11-09
Updated: 2026-11-09
Code: https://github.com/vakiliana/sublinear-steiner-tree
Terminology
Sources
- Query Complexity of the Metric Steiner Tree Problem
- Tight Analysis of Randomized Greedy MIS
- The Sparse Vector Technique, Revisited
- A Better Lower Bound for Sublinear Metric Steiner Tree
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time