Hardness Results for Approximate Distance Labeling in Sparse Graphs
cs.DS
Submitted: 2026-11-02
Updated: 2026-11-02
Terminology
Sources
- Breaking the logarithmic barrier in Roth's theorem on arithmetic progressions
- Improving Behrend's construction: Sets without arithmetic progressions in integers and over finite fields
- Sets of integers that do not contain long arithmetic progressions
- Improved Bounds for 3-Progressions
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