A simpler and faster strongly polynomial algorithm for generalized flow maximization

Olver, Neil ORCID: 0000-0001-8897-5459 and Végh, László A. ORCID: 0000-0003-1152-200X (2020) A simpler and faster strongly polynomial algorithm for generalized flow maximization. Journal of the ACM, 67 (2). ISSN 0004-5411

Text (A simpler and faster strongly polynomial algorithm for generalized flow maximization) - Accepted Version Download (440kB)

• Author
• Author

Abstract

We present a new strongly polynomial algorithm for generalized flow maximization that is significantly simpler and faster than the previous strongly polynomial algorithm [34]. For the uncapacitated problem formulation, the complexity bound O(mn(m + n log n) log(n2/m)) improves on the previous estimate by almost a factor O(n2). Even for small numerical parameter values, our running time bound is comparable to the best weakly polynomial algorithms. The key new technical idea is relaxing the primal feasibility conditions. This allows us to work almost exclusively with integral flows, in contrast to all previous algorithms for the problem.

Item Type:	Article
Official URL:	https://dl.acm.org/journal/jacm
Additional Information:	© 2020 The Authors
Divisions:	Mathematics
Subjects:	Q Science > QA Mathematics
Date Deposited:	13 Feb 2020 16:12
Last Modified:	20 Dec 2024 00:38
URI:	http://eprints.lse.ac.uk/id/eprint/103370

Actions (login required)

View Item