High-accuracy multicommodity flows via iterative refinement
From MaRDI portal
Cites work
- 2-norm flow diffusion in near-linear time
- A natural randomization strategy for multicommodity flow and related algorithms
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A survey of algorithms for convex multicommodity flow problems
- A Survey of Linear Cost Multicommodity Network Flows
- An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations
- An homotopy method for l p regression provably beyond self-concordance and in input-sparsity time
- Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
- Approximate undirected maximum flows in \(O(m\operatorname{polylog}(n))\) time
- Approximating fractional multicommodity flow independent of the number of commodities
- Area-convexity, _ regularization, and undirected multicommodity flow
- Bipartite matching in nearly-linear time on moderately dense graphs
- Circulation control for faster minimum cost flow in unit-capacity graphs
- Computing maximum flow with augmenting electrical flows
- Deterministic decremental SSSP and approximate min-cost flow in almost-linear time
- Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Fast approximation algorithms for multicommodity flow problems
- Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
- Fast deterministic approximation for the multicommodity flow problem
- Faster p-norm minimizing flows, via smoothed q-norm problems
- Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
- Faster approximate multicommodity flow using quadratically coupled flows
- Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
- Faster approximation schemes for fractional multicommodity flow problems
- Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
- Faster maxflow via improved dynamic spectral vertex sparsifiers
- Faster parallel algorithm for approximate shortest path
- Faster sparse minimum cost flow by electrical flow localization
- Feasibility of Two Commodity Network Flows
- Flows in almost linear time via adaptive preconditioning
- Fully dynamic electrical flows: sparse maxflow faster than Goldberg-Rao
- scientific article; zbMATH DE number 5485557 (Why is no real title available?)
- scientific article; zbMATH DE number 1263177 (Why is no real title available?)
- scientific article; zbMATH DE number 910872 (Why is no real title available?)
- scientific article; zbMATH DE number 7788369 (Why is no real title available?)
- Iterative refinement for \(\ell_p\)-norm regression
- Low-rank approximation and regression in input sparsity time
- Maximum flow and minimum-cost flow in almost-linear time
- Minimum cost flows, MDPs, and ℓ 1 -regression in nearly linear time for dense instances
- Minor sparsifiers and the distributed Laplacian paradigm
- Multicommodity network flows: a survey. I: Applications and formulations
- Navigating central path with electrical flows: from flows to matchings, and back
- Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
- Nearly maximum flows in nearly linear time
- Negative-weight shortest paths and unit capacity minimum cost flow in \(\tilde{O}(m^{10/7}\log W)\) time (extended abstract)
- Network flows. Theory, algorithms, and applications.
- Polynomial algorithms in linear programming
- Sampling Algorithms and Coresets for \ell_p Regression
- Solving linear programs in the current matrix multiplication time
- Solving Linear Programs in the Current Matrix Multiplication Time
- Speeding up Karmarkar's algorithm for multicommodity flows
- The fast Cauchy transform and faster robust linear regression
- The maximum concurrent flow problem
- Two-Commodity Flow
- Two-commodity flow is equivalent to linear programming under nearly-linear time reductions
- Unit capacity maxflow in almost \(O(m^{4/3})\) time
- Universally-optimal distributed shortest paths and transshipment via graph-based _1-oblivious routing
This page was built for publication: High-accuracy multicommodity flows via iterative refinement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875159)
