Improved Bounds on Distance Preservers
cs.DS
Submitted: 2026-11-04
Updated: 2026-11-04
Terminology
Sources
- Minimum Weight Pairwise Distance Preservers
- New Separations and Reductions for Directed Preservers and Hopsets
- Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers
- Color Fault-Tolerant Distance Preservers: \~{O}ptimal Size in Conditionally \~{O}ptimal Time
- Finding Minimum Distance Preservers: A Parameterized Study
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