{"id":"doi:10.1145/3610940","kind":"article","title":"Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow","authors":["Li Chen","Rasmus Kyng","Yang P. Liu","Richard Peng","Maximilian Probst Gutenberg","Sushant Sachdeva"],"author_count":6,"year":2023,"published":"2023-11-17","venue":"Communications of the ACM","cited_by":18,"doi":"10.1145/3610940","arxiv_id":null,"nct_id":null,"source_url":"https://doi.org/10.1145/3610940","archive_url":"https://space-kitty.com/papers/doi:10.1145/3610940","updated":null,"pmid":null,"pmcid":null,"openalex_id":"W4388750673","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3610940","abstract":null,"abstract_license":null,"license":null,"is_open_access":true,"retracted":false,"peer_reviewed":null,"categories":["Complexity and Algorithms in Graphs"],"details":null,"provenance":"openalex","attribution":"Metadata and citation counts: OpenAlex (CC0).","topics":[{"slug":"algorithms-complexity","name":"Algorithms & Complexity Breakthroughs","domain_slug":"math-cs"}],"cited_in_dossiers":[]}