Abstract
We prove that an algorithm of Schrijver, that computes an integral packing of branchings in a capacitaded digraph, produces a packing with no more than \(m + r - 1\) different branchings, where \(m\) is the number of arcs, and \(r\) the number of root-sets of the digraph.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Edmonds J (1973) Edge-disjoint branchings, combinatorial algorithms. Academic Press, New York
Frank A (2011) Connections in combinatorial optimization, Oxford Lectures in mathematics and its applications, vol 38. Oxford University Press, Oxford
Gabow HN, Manu KS (1998) Packing algorithms for arborescences (and spanning trees) in capacitated graphs. Math Program 82:83–109
Lovász L (1976) On two minimax theorems on graph theory. J Comb Theory Ser B 21:96–103
Schrijver A (2003) Combinatorial optimization: polyhedra and efficiency. Springer, Berlin
Acknowledgments
We thank the referees for suggestions that improved the presentation of this paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
This paper is dedicated to the memory of Antonio Leston Rey.
Rights and permissions
About this article
Cite this article
Leston-Rey, M. Integral packing of branchings in capacitaded digraphs. J Comb Optim 31, 506–514 (2016). https://doi.org/10.1007/s10878-014-9768-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-014-9768-3