Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model
From MaRDI portal
Publication:6202225
DOI10.1145/3583668.3594566OpenAlexW4380880524MaRDI QIDQ6202225
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
- Unnamed Item
- Single-source shortest paths in the CONGEST model with improved bounds
- A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
- An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- Distributed Computing: A Locality-Sensitive Approach
- Near-Optimal Distributed Maximum Flow
- Approximate Undirected Maximum Flows in O(mpolylog(n)) Time
- Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (m10/7 log W) Time (Extended Abstract)
- Distributed Verification and Hardness of Distributed Approximation
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
- Distributed Approximate Maximum Matching in the CONGEST Model.
- Faster parallel algorithm for approximate shortest path
- Parallel approximate undirected shortest paths via low hop emulators
- Faster energy maximization for faster maximum flow
- An efficient parallel solver for SDD linear systems
- Solving SDD linear systems in nearly m log 1/2 n time
- Sparsified Cholesky and multigrid solvers for connection laplacians
- An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
- Approaching Optimality for Solving SDD Linear Systems
- A Nearly-m log n Time Solver for SDD Linear Systems
- A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
This page was built for publication: Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model
