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

@inproceedings{Ghaffari2018NewDA,
  title={New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms},
  author={Mohsen Ghaffari and Jason Li},
  booktitle={DISC},
  year={2018}
}
We show that many classical optimization problems – such as (1 ± )-approximate maximum flow, shortest path, and transshipment – can be computed in τmix(G) ·no(1) rounds of distributed message passing, where τmix(G) is the mixing time of the network graph G. This extends the result of Ghaffari et al. [PODC’17], whose main result is a distributed MST algorithm in τmix(G)· 2O( √ logn log logn) rounds in the CONGEST model, to a much wider class of optimization problems. For many practical networks… CONTINUE READING

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…