2 papers
cs.DS2026
Size-Sensitive Padded Decompositions for Faster Deterministic Negative-Weight Shortest Paths
Khoi Duong
We give a deterministic algorithm for single-source shortest paths in directed graphs with integral edge weights at least that runs in time $$O((m+n\log\log n)\log^2 n \log(nW…
cs.CG2026
A Fast Quasi-Linear Heuristic for the Close-Enough Traveling Salesman Problem
Khoi Duong
We introduce a fast, quasi-linear-time heuristic for the Close-Enough Traveling Salesman Problem (CETSP), a continuous generalization of the Euclidean TSP in which each target is a…