Olver, Neil 
ORCID: 0000-0001-8897-5459 and Végh, László A. ORCID: 0000-0003-1152-200X
(2017)
A simpler and faster strongly polynomial algorithm for generalized flow maximization.
In: STOC 2017 Theory Fest: 49th Annual ACM Symposium on the Theory of Computing, 2017-06-19 - 2017-06-23, Hyatt Regency, Montreal, Montreal, Canada, CAN.
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: | Conference or Workshop Item (Paper) |
|---|---|
| Official URL: | http://acm-stoc.org/stoc2017/toc.html |
| Additional Information: | © 2017 ACM |
| Divisions: | Mathematics |
| Subjects: | Q Science > QA Mathematics |
| Date Deposited: | 24 Jan 2020 14:54 |
| Last Modified: | 18 Oct 2024 23:18 |
| URI: | http://eprints.lse.ac.uk/id/eprint/103177 |
Actions (login required)
 |
View Item |
