2 papers
cs.DS2026
Deterministic Distance Approximation in MPC via Improved Hitting Sets
Kyungjin Cho, Michal Dory, Yannic Maus +1
In this paper, we provide the first deterministic algorithms with sublogarithmic round complexity for spanners and approximate shortest paths in various MPC models. Moreover, we si…
cs.DS2025
Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances
Jan van den Brand, Hossein Gholizadeh, Yonggang Jiang +1
For -vertex -edge graphs with integer polynomially-bounded costs and capacities, we provide a randomized parallel algorithm for the minimum cost flow problem with $\tilde O(m…