A Potential Reduction Inspired Algorithm for Exact Max Flow in Almost O(m^4/3) Time

09/07/2020
by   Tarun Kathuria, et al.
0

We present an algorithm for computing s-t maximum flows in directed graphs in O(m^4/3+o(1)U^1/3) time. Our algorithm is inspired by potential reduction interior point methods for linear programming. Instead of using scaled gradient/Newton steps of a potential function, we take the step which maximizes the decrease in the potential value subject to advancing a certain amount on the central path, which can be efficiently computed. This allows us to trace the central path with our progress depending only ℓ_∞ norm bounds on the congestion vector (as opposed to the ℓ_4 norm required by previous works) and runs in O(√(m)) iterations. To improve the number of iterations by establishing tighter bounds on the ℓ_∞ norm, we then consider the weighted central path framework of Madry <cit.> and Liu-Sidford <cit.>. Instead of changing weights to maximize energy, we consider finding weights which maximize the maximum decrease in potential value. Finally, similar to finding weights which maximize energy as done in <cit.> this problem can be solved by the iterative refinement framework for smoothed ℓ_2-ℓ_p norm flow problems <cit.> completing our algorithm. We believe our potential reduction based viewpoint provides a versatile framework which may lead to faster algorithms for max flow.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/19/2020

Faster Divergence Maximization for Faster Maximum Flow

In this paper we provide an algorithm which given any m-edge n-vertex di...
research
10/31/2019

Faster Energy Maximization for Faster Maximum Flow

In this paper we provide an algorithm which given any m-edge n-vertex di...
research
10/23/2019

Faster p-norm minimizing flows, via smoothed q-norm problems

We present faster high-accuracy algorithms for computing ℓ_p-norm minimi...
research
02/15/2023

On Finite-Step Convergence of the Non-Greedy Algorithm for L_1-Norm PCA and Beyond

The non-greedy algorithm for L_1-norm PCA proposed in <cit.> is revisite...
research
06/13/2020

Perturbed Newton Method with Trust-region Time-stepping Schemes for Linear Programming with Uncertain Data

In this article, we consider the path-following method based on the pert...
research
04/24/2023

On the Performance of a Novel Class of Linear System Solvers and Comparison with State-of-The-Art Algorithms

We present a comprehensive computational study of a class of linear syst...
research
07/10/2023

New Variants of Frank-Wolfe Algorithm for Video Co-localization Problem

The co-localization problem is a model that simultaneously localizes obj...

Please sign up or login with your details

Forgot password? Click here to reset