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

DOI10.1145/3406325.3451108arXiv2101.05719OpenAlexW3167705025MaRDI QIDQ6087050

No author found.

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.05719

zbMATH Keywords

linear programdata structureInterior point method

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (6)

Unit Capacity Maxflow in Almost $m^{4/3}$ Time ⋮ Hypergraph Cuts with General Splitting Functions ⋮ A weight-scaling algorithm for \(f\)-factors of multigraphs ⋮ A survey on exact algorithms for the maximum flow and minimum‐cost flow problems ⋮ The rotation distance of brooms ⋮ Unnamed Item

This page was built for publication: Minimum cost flows, MDPs, and ℓ ₁ -regression in nearly linear time for dense instances