Minimum Cost Flow in the CONGEST Model

04/04/2023
by   Tijn de Vos, et al.
0

We consider the CONGEST model on a network with n nodes, m edges, diameter D, and integer costs and capacities bounded by poly n. In this paper, we show how to find an exact solution to the minimum cost flow problem in n^1/2+o(1)(√(n)+D) rounds, improving the state of the art algorithm with running time m^3/7+o(1)(√(n)D^1/4+D) [Forster et al. FOCS 2021], which only holds for the special case of unit capacity graphs. For certain graphs, we achieve even better results. In particular, for planar graphs, expander graphs, n^o(1)-genus graphs, n^o(1)-treewidth graphs, and excluded-minor graphs our algorithm takes n^1/2+o(1)D rounds. We obtain this result by combining recent results on Laplacian solvers in the CONGEST model [Forster et al. FOCS 2021, Anagnostides et al. DISC 2022] with a CONGEST implementation of the LP solver of Lee and Sidford [FOCS 2014], and finally show that we can round the approximate solution to an exact solution. Our algorithm solves certain linear programs, that generalize minimum cost flow, up to additive error ϵ in n^1/2+o(1)(√(n)+D)log^3 (1/ϵ) rounds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/29/2022

Low Treewidth Embeddings of Planar and Minor-Free Metrics

Cohen-Addad, Filtser, Klein and Le [FOCS'20] constructed a stochastic em...
research
11/29/2021

Local planar domination revisited

We show how to compute a 20-approximation of a minimum dominating set in...
research
05/24/2022

The Laplacian Paradigm in the Broadcast Congested Clique

In this paper, we bring the main tools of the Laplacian paradigm to the ...
research
01/14/2021

Minimum Cost Flows, MDPs, and ℓ_1-Regression in Nearly Linear Time for Dense Instances

In this paper we provide new randomized algorithms with improved runtime...
research
12/31/2020

Minor Sparsifiers and the Distributed Laplacian Paradigm

We study distributed algorithms built around edge contraction based vert...
research
04/05/2023

The Laplacian Paradigm in Deterministic Congested Clique

In this paper, we bring the techniques of the Laplacian paradigm to the ...
research
05/12/2018

New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms

We show that many classical optimization problems --- such as (1±ϵ)-appr...

Please sign up or login with your details

Forgot password? Click here to reset