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

DOI10.4230/LIPICS.ICALP.2022.54MaRDI QIDQ6560848zbMATH OpenFDO

Authors Ming Ding, Rasmus Kyng, Peng Zhang

Publication date 24 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2022.54

zbMATH Keywords

linear programmingfine-grained complexitytwo-commodity flow problems

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cited in

(1)

• High-accuracy multicommodity flows via iterative refinement

This page was built for publication: Two-commodity flow is equivalent to linear programming under nearly-linear time reductions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560848)