Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Faster Algorithm for Packing Branchings in Digraphs   We consider the problem of finding an integral packing of branchings in a
capacitated digraph with root-set demands. Schrijver described an algorithm
that returns a packing with at most m+n^3+r branchings that makes at most
m(m+n^3+r) calls to an oracle that basically computes a minimum cut, where n is
the number of vertices, m is the number of arcs and r is the number of
root-sets of the input digraph. In this work we provide an algorithm, inspired
on ideas of Schrijver and on an paper of Gabow and Manu, that returns a packing
with at most m+r-1 branchings and makes at most 2n+m+r-1 oracle calls.

37
The categories of this paper are: supr-con
9
The categories of this paper are: nlin
12
The categories of this paper are: nucl-th
5
The categories of this paper are: gr-qc
20
The categories of this paper are: acc-phys
17
The categories of this paper are: q-fin
6
The categories of this paper are: astro-ph
27
The categories of this paper are: comp-gas
31
The categories of this paper are: ao-sci
34
The categories of this paper are: chem-ph
8
The categories of this paper are: hep-ex
10
The categories of this paper are: q-bio
26
The categories of this paper are: bayes-an
3
The categories of this paper are: physics
13
The categories of this paper are: quant-ph
24
The categories of this paper are: dg-ga