Reading between the levels: new tools for the Thorup-Zwick hierarchy and their applications
cs.DS
Submitted: 2026-10-31
Updated: 2026-10-31
Terminology
Sources
- Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
- A Tight Space Lower Bound for Pivot-Based Distance Oracles
- Additive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-offs and Algorithms
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