Unit Capacity Maxflow in Almost $m^{4/3}$ Time (Q5071088): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Iterative Refinement for <i>ℓ<sub>p</sub></i>-norm Regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster <i>p</i>-norm minimizing flows, via smoothed <i>q</i>-norm problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An homotopy method for l <sub>p</sub> regression provably beyond self-concordance and in input-sparsity time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Runtime guarantees for regression problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Max-Flow on Small Depth Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving linear programs in the current matrix multiplication 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: Network Flow and Testing Graph Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond the flow decomposition barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Sampling in Cut, Flow, and Network Design Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542522 / 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: Faster approximate multicommodity flow using quadratically coupled flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flows in almost linear time via adaptive preconditioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to computing maximum flows using electrical flows / 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: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max flows in O(nm) time, or better / 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: A polynomial-time algorithm, based on Newton's method, for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Area-convexity, l <sub>∞</sub> regularization, and undirected multicommodity flow / 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
Property / cites work
 
Property / cites work: Minimum cost flows, MDPs, and ℓ <sub>1</sub> -regression in nearly linear time for dense instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving tall dense linear programs in nearly linear time / rank
 
Normal rank

Revision as of 16:50, 28 July 2024

scientific article; zbMATH DE number 7510284
Language Label Description Also known as
English
Unit Capacity Maxflow in Almost $m^{4/3}$ Time
scientific article; zbMATH DE number 7510284

    Statements

    Unit Capacity Maxflow in Almost $m^{4/3}$ Time (English)
    0 references
    20 April 2022
    0 references
    maximum flow
    0 references
    optimization
    0 references
    interior point methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers