Fast Approximations for Rooted Connectivity in Weighted Directed Graphs

04/14/2021
by   Kent Quanrud, et al.
0

We consider approximations for computing minimum weighted cuts in directed graphs. We consider both rooted and global minimum cuts, and both edge-cuts and vertex-cuts. For these problems we give randomized Monte Carlo algorithms that compute a (1+ϵ)-approximate minimum cut in Õ(n^2 / ϵ^2) time. These results extend and build on recent work [4] that obtained exact algorithms with similar running times in directed graphs with small integer capacities.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/15/2021

Faster Algorithms for Rooted Connectivity in Directed Graphs

We consider the fundamental problems of determining the rooted and globa...
research
11/17/2021

Minimum Cuts in Directed Graphs via Partial Sparsification

We give an algorithm to find a minimum cut in an edge-weighted directed ...
research
04/16/2021

Minimum Cuts in Directed Graphs via √(n) Max-Flows

We give an algorithm to find a mincut in an n-vertex, m-edge weighted di...
research
03/24/2021

Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Global Connectivity Problems

Li and Panigrahi, in recent work, obtained the first deterministic algor...
research
11/27/2021

On lossy Compression of Directed Graphs

The method of types presented by Csiszar and Korner is a central tool us...
research
05/13/2022

Simplex Closing Probabilities in Directed Graphs

Recent work in mathematical neuroscience has calculated the directed gra...
research
02/12/2021

The Structure of Minimum Vertex Cuts

In this paper we continue a long line of work on representing the cut st...

Please sign up or login with your details

Forgot password? Click here to reset