Smallest Multiplicative Stretch for an alpha-APASP Below O (n omega) Runtime
cs.DS
Submitted: 2026-11-03
Updated: 2026-11-03
Code: https://github.com/openai/math
Terminology
Sources
- Multiplying matrices via polynomials: exposition and barriers
- Fast 2-Approximate All-Pairs Shortest Paths
- Improved 2-Approximate Shortest Paths for close vertex pairs
- $\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost
- Improved Additive Approximation Algorithms for APSP
- Deterministic Monotone Min-Plus Product and Convolution
- Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs
Related papers
- 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
- Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed Cycles