A polynomial-time approximation scheme for the weighted Euclidean Minimum Latency Problem in fixed dimension
cs.DS, math.CO
Submitted: 2026-11-11
Updated: 2026-11-11
Terminology
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