Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model
From MaRDI portal
Publication:6202225
DOI10.1145/3583668.3594566OpenAlexW4380880524MaRDI QIDQ6202225FDOQ6202225
Authors: Tijn de Vos 
Publication date: 26 March 2024
Published in: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3583668.3594566
Cites Work
- Distributed Computing: A Locality-Sensitive Approach
- Distributed verification and hardness of distributed approximation
- Solving SDD linear systems in nearly \(m \log^{1/2} n\) time
- Approaching optimality for solving SDD linear systems
- A Nearly-m log n Time Solver for SDD Linear Systems
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction
- Title not available (Why is that?)
- Sparsified Cholesky and multigrid solvers for connection Laplacians
- An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations
- A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
- Negative-weight shortest paths and unit capacity minimum cost flow in \(\tilde{O}(m^{10/7}\log W)\) time (extended abstract)
- An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem
- An efficient parallel solver for SDD linear systems
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
- Faster parallel algorithm for approximate shortest path
- Parallel approximate undirected shortest paths via low hop emulators
- Faster energy maximization for faster maximum flow
- Single-source shortest paths in the CONGEST model with improved bounds
- Near-optimal distributed maximum flow
- Approximate undirected maximum flows in \(O(m\operatorname{polylog}(n))\) time
- Distributed approximate maximum matching in the CONGEST model
This page was built for publication: Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202225)
