The Value of Steiner Hubs in Two-Hop Distance Labeling
cs.DS, cs.CC, cs.DM, math.CO
Submitted: 2026-10-31
Updated: 2026-10-31
Terminology
Sources
- Simpler, faster and shorter labels for distances in graphs
- Smaller Low-Depth Circuits for Kronecker Powers
- Algorithmic and Hardness Results for the Hub Labeling Problem
- Optimal Preprocessing for Answering On-Line Product Queries
- DAG Covers: The Steiner Point Effect
- On the Complexity of Hub Labeling
- Folklore Sampling is Optimal for Exact Hopsets: Confirming the $\sqrt{n}$ Barrier
- Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
- Three notions of tropical rank for symmetric matrices
- Fractional coverings, greedy coverings, and rectifier networks
- An $\tilde\Omega\big(\sqrt{\log |T|}\big)$ Lower Bound for Steiner Point Removal
- Helly-gap of a graph and vertex eccentricities
- On the rank of a tropical matrix
- Engineering Insights into Biclique Partitions and Fractional Binary Ranks of Matrices
- Sublinear-Space Distance Labeling using Hubs
- Separating Hierarchical and General Hub Labelings
- Upper Bounds on the Boolean Rank of Kronecker Products
- Towards Lower Bounds for Geometric Spanners in High Dimension
- Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling
- Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons
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