Simpler and Faster Directed Low-Diameter Decompositions

We present a simpler and faster algorithm for low-diameter decompositions on directed graphs, matching the $O(\log n\log \log n)$ loss factor from Bringmann, Fischer, Haeupler, and Latypov (ICALP 2025) and improving the running time to $O((m+n\log \log n){\log }^{2}n)$.