Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Fast Approximations for Rooted Connectivity in Weighted Directed Graphs   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+\epsilon)$-approximate minimum cut in $\tilde{O}(n^2 /
\epsilon^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.

11
The categories of this paper are: hep-lat
16
The categories of this paper are: stat
2
The categories of this paper are: math
30
The categories of this paper are: q-alg
26
The categories of this paper are: bayes-an
19
The categories of this paper are: eess
12
The categories of this paper are: nucl-th
34
The categories of this paper are: chem-ph
22
The categories of this paper are: chao-dyn
24
The categories of this paper are: dg-ga
27
The categories of this paper are: comp-gas
21
The categories of this paper are: adap-org
20
The categories of this paper are: acc-phys
6
The categories of this paper are: astro-ph
10
The categories of this paper are: q-bio
14
The categories of this paper are: math-ph