Cookies?
Library Header Image
LSE Research Online LSE Library Services

A simpler and faster strongly polynomial algorithm for generalized flow maximization

Olver, Neil and Végh, László A. (2017) A simpler and faster strongly polynomial algorithm for generalized flow maximization. In: STOC: ACM Symposium on Theory of Computing. ACM Press, 100 - 111.

Full text not available from this repository.

Identification Number: 10.1145/3055399.3055439

Abstract

We present a new strongly polynomial algorithm for generalized flow maximization. The first strongly polynomial algorithm for this problem was given very recently by Végh; our new algorithm is much simpler, and much faster. The complexity bound O((m+nlogn)mnlog(n2/m)) improves on the previous estimate obtained by Végh by almost a factor O(n2). Even for small numerical parameter values, our algorithm is essentially as fast as the best weakly polynomial algorithms. The key new technical idea is relaxing primal feasibility conditions. This allows us to work almost exclusively with integral flows, in contrast to all previous algorithms.

Item Type: Book Section
Official URL: https://dl.acm.org/doi/proceedings/10.1145/3055399
Additional Information: © 2017 ACM
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 21 Jan 2020 00:42
Last Modified: 13 Feb 2020 15:33
URI: http://eprints.lse.ac.uk/id/eprint/103086

Actions (login required)

View Item View Item