On the Communication Complexity of Shortcut Set Computation
cs.DS
Submitted: 2026-11-06
Updated: 2026-11-06
Terminology
Sources
- Greedy Algorithms for Shortcut Sets and Hopsets
- Better Diameter Bounds for Efficient Shortcuts and a Structural Criterion for Constructiveness
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