AI Chat AI Image Generator AI Video Text to Speech

Incremental Approximate Maximum Flow in m^1/2+o(1) update time

11/17/2022

∙

by Gramoz Goranci, et al.

∙

∙

We show an (1+ϵ)-approximation algorithm for maintaining maximum s-t flow under m edge insertions in m^1/2+o(1)ϵ^-1/2 amortized update time for directed, unweighted graphs. This constitutes the first sublinear dynamic maximum flow algorithm in general sparse graphs with arbitrarily good approximation guarantee.

Gramoz Goranci
22 publications
Monika Henzinger
71 publications

page 1

page 2

page 3

page 4

research

∙ 02/10/2023

Dynamic (1+ε)-Approximate Matching Size in Truly Sublinear Update Time

We show a fully dynamic algorithm for maintaining (1+ϵ)-approximate size...

0 Sayan Bhattacharya, et al. ∙

research

∙ 05/10/2020

Improved Bi-criteria Approximation for the All-or-Nothing Multicommodity Flow Problem in Arbitrary Networks

This paper addresses the following fundamental maximum throughput routin...

0 Anya Chaturvedi, et al. ∙

research

∙ 07/28/2023

Dynamic algorithms for k-center on graphs

In this paper we give the first efficient algorithms for the k-center pr...

0 Emilio Cruciani, et al. ∙

research

∙ 02/16/2023

Incremental (1-ε)-approximate dynamic matching in O(poly(1/ε)) update time

In the dynamic approximate maximum bipartite matching problem we are giv...

0 Joakim Blikstad, et al. ∙

research

∙ 07/03/2022

Decremental Matching in General Graphs

We consider the problem of maintaining an approximate maximum integral m...

0 Sepehr Assadi, et al. ∙

research

∙ 01/12/2023

Incremental Dead State Detection in Logarithmic Time

Identifying live and dead states in an abstract transition system is a r...

0 Caleb Stanford, et al. ∙

research

∙ 07/31/2019

Sublinear Subwindow Search

We propose an efficient approximation algorithm for subwindow search tha...

3 Max Reuter, et al. ∙