Maximum Flow and Minimum-Cost Flow in Almost-Linear Time

We give an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and polynomially bounded integral demands, costs, and capacities in m^{1+o(1)} time. Our algorithm builds the flow through a sequence of m^{1+o(1)} approximate undirected minimum-ratio cycle...

Full description

Bibliographic Details

Published in:	Proceedings / annual Symposium on Foundations of Computer Science pp. 612 - 623
Main Authors:	Chen, Li, Kyng, Rasmus, Liu, Yang P., Peng, Richard, Gutenberg, Maximilian Probst, Sachdeva, Sushant
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.10.2022
Subjects:	Approximation algorithms Computer science Convex optimization Costs Data structures Directed acyclic graph Directed graphs Heuristic algorithms Integral equations Interior point methods Maximum flow Minimum cost flow
ISSN:	2575-8454
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!