We obtain the first near-linear time deterministic algorithm for negative-weight single-source shortest paths on integer-weighted graphs. Our main ingredient is a deterministic construction of a padded decomposition on directed graphs, which may be of independent interest.

翻译：我们首次提出了针对整数权重图上负权单源最短路径问题的近线性时间确定性算法。我们的核心贡献是提出了一种针对有向图的确定性填充分解构造方法，该方法可能具有独立的学术价值。