# Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow

Article · Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva

- Archive id: doi:10.1145/3610940
- Published: 2023-11-17
- Venue: Communications of the ACM
- DOI: https://doi.org/10.1145/3610940
- Citations: 18
- Source URL: https://doi.org/10.1145/3610940
- PDF: https://dl.acm.org/doi/pdf/10.1145/3610940
- Provenance: openalex

_Abstract not reproduced: its license does not permit redistribution. See the source URL._

Topics: [Algorithms & Complexity Breakthroughs](https://space-kitty.com/topics/algorithms-complexity)

---
Space Kitty Archive · https://space-kitty.com · API: https://space-kitty.com/api/v1 · MCP: https://space-kitty.com/mcp · Premium: $0.20/request via x402 (Base Sepolia (testnet)). Metadata: arXiv (CC0), OpenAlex (CC0), Europe PMC (CC BY/CC0 works), ClinicalTrials.gov.