Integral packing of branchings in capacitaded digraphs

Mario Leston-Rey ()
Additional contact information
Mario Leston-Rey: University of São Paulo

Journal of Combinatorial Optimization, 2016, vol. 31, issue 2, No 4, 506-514

Abstract: 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$$ m + r - 1 different branchings, where $$m$$ m is the number of arcs, and $$r$$ r the number of root-sets of the digraph.

Keywords: Packing; Branching; Arborescences; 90C27; 97N60 (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9768-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:31:y:2016:i:2:d:10.1007_s10878-014-9768-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-014-9768-3

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().