High-accuracy multicommodity flows via iterative refinement (Q6875159)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

High-accuracy multicommodity flows via iterative refinement

scientific article; zbMATH DE number 8144507

Language	Label	Description	Also known as
default for all languages	No label defined
English	High-accuracy multicommodity flows via iterative refinement	scientific article; zbMATH DE number 8144507

Statements

instance of

scholarly article

0 references

title

High-accuracy multicommodity flows via iterative refinement (English)

0 references

0 references

0 references

14 January 2026

0 references

copyright license

Creative Commons Attribution 4.0 International

0 references

zbMATH Keywords

high-accuracy multicommodity flow

0 references

iterative refinement framework

0 references

convex flow solver

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Iterative refinement for $\ell_p$-norm regression

0 references

Faster p-norm minimizing flows, via smoothed q-norm problems

0 references

Network flows. Theory, algorithms, and applications.

0 references

Circulation control for faster minimum cost flow in unit-capacity graphs

0 references

Faster sparse minimum cost flow by electrical flow localization

0 references

Deterministic decremental SSSP and approximate min-cost flow in almost-linear time

0 references

Bipartite matching in nearly-linear time on moderately dense graphs

0 references

An homotopy method for l p regression provably beyond self-concordance and in input-sparsity time

0 references

Maximum flow and minimum-cost flow in almost-linear time

0 references

2-norm flow diffusion in near-linear time

0 references

Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs

0 references

The fast Cauchy transform and faster robust linear regression

0 references

Low-rank approximation and regression in input sparsity time

0 references

Solving linear programs in the current matrix multiplication time

0 references

Solving Linear Programs in the Current Matrix Multiplication Time

0 references

Negative-weight shortest paths and unit capacity minimum cost flow in $\tilde{O}(m^{10/7}\log W)$ time (extended abstract)

0 references

Q3549731

0 references

Sampling Algorithms and Coresets for $\ell_p$ Regression

0 references

Two-commodity flow is equivalent to linear programming under nearly-linear time reductions

0 references

Approximating fractional multicommodity flow independent of the number of commodities

0 references

Minor sparsifiers and the distributed Laplacian paradigm

0 references

Fully dynamic electrical flows: sparse maxflow faster than Goldberg-Rao

0 references

Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems

0 references

A natural randomization strategy for multicommodity flow and related algorithms

0 references

Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints

0 references

Approximate minimum-cost multicommodity flows in $\widetilde O(\varepsilon^{-2}KNM)$ time

0 references

Two-Commodity Flow

0 references

Speeding up Karmarkar's algorithm for multicommodity flows

0 references

Faster approximation schemes for fractional multicommodity flow problems

0 references

Q4234047

0 references

Unit capacity maxflow in almost $O(m^{4/3})$ time

0 references

An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations

0 references

Faster approximate multicommodity flow using quadratically coupled flows

0 references

A Survey of Linear Cost Multicommodity Network Flows

0 references

Polynomial algorithms in linear programming

0 references

Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts

0 references

Flows in almost linear time via adaptive preconditioning

0 references

Fast approximation algorithms for multicommodity flow problems

0 references

Faster parallel algorithm for approximate shortest path

0 references

Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms

0 references

Navigating central path with electrical flows: from flows to matchings, and back

0 references

Computing maximum flow with augmenting electrical flows

0 references

A survey of algorithms for convex multicommodity flow problems

0 references

Approximate undirected maximum flows in $O(m\operatorname{polylog}(n))$ time

0 references

Q6147280

0 references

Fast Approximation Algorithms for Fractional Packing and Covering Problems

0 references

Fast deterministic approximation for the multicommodity flow problem

0 references

A polynomial-time algorithm, based on Newton's method, for linear programming

0 references

Feasibility of Two Commodity Network Flows

0 references

The maximum concurrent flow problem

0 references

Nearly maximum flows in nearly linear time

0 references

Area-convexity, $\ell_\infty$ regularization, and undirected multicommodity flow

0 references

Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems

0 references

Faster maxflow via improved dynamic spectral vertex sparsifiers

0 references

Minimum cost flows, MDPs, and ℓ 1 -regression in nearly linear time for dense instances

0 references

Multicommodity network flows: a survey. I: Applications and formulations

0 references

Q4886046

0 references

Universally-optimal distributed shortest paths and transshipment via graph-based $\ell_1$-oblivious routing

0 references

Identifiers

DOI

10.4230/LIPICS.ICALP.2024.45

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi High-accuracy multicommodity flows via iterative refinement