Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model
From MaRDI portal
Cites work
- A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction
- A Nearly-m log n Time Solver for SDD Linear Systems
- A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
- An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations
- An efficient parallel solver for SDD linear systems
- An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem
- Approaching optimality for solving SDD linear systems
- Approximate undirected maximum flows in \(O(m\operatorname{polylog}(n))\) time
- Distributed approximate maximum matching in the CONGEST model
- Distributed Computing: A Locality-Sensitive Approach
- Distributed verification and hardness of distributed approximation
- Faster energy maximization for faster maximum flow
- Faster parallel algorithm for approximate shortest path
- scientific article; zbMATH DE number 5485557 (Why is no real title available?)
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
- Near-optimal distributed maximum flow
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- Negative-weight shortest paths and unit capacity minimum cost flow in \(\tilde{O}(m^{10/7}\log W)\) time (extended abstract)
- Parallel approximate undirected shortest paths via low hop emulators
- Single-source shortest paths in the CONGEST model with improved bounds
- Solving SDD linear systems in nearly \(m \log^{1/2} n\) time
- Sparsified Cholesky and multigrid solvers for connection Laplacians
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)
