Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model (Q6202225): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Distributed Approximate Maximum Matching in the CONGEST Model. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel approximate undirected shortest paths via low hop emulators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-source shortest paths in the CONGEST model with improved bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving SDD linear systems in nearly <i>m</i> log <sup>1/2</sup> <i>n</i> time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (<i>m</i><sup>10/7</sup> log <i>W</i>) Time (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Distributed Maximum Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple, combinatorial algorithm for solving SDD systems in nearly-linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly-m log n Time Solver for SDD Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approaching Optimality for Solving SDD Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsified Cholesky and multigrid solvers for connection laplacians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster parallel algorithm for approximate shortest path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster energy maximization for faster maximum flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Undirected Maximum Flows in <i>O</i>(<i>m</i>polylog(<i>n</i>)) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient parallel solver for SDD linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Verification and Hardness of Distributed Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems / rank
 
Normal rank

Latest revision as of 17:05, 28 August 2024

scientific article; zbMATH DE number 7824312
Language Label Description Also known as
English
Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model
scientific article; zbMATH DE number 7824312

    Statements

    Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model (English)
    0 references
    0 references
    26 March 2024
    0 references
    CONGEST model
    0 references
    minimum cost flow
    0 references
    LP solver
    0 references
    0 references

    Identifiers