Abstract
For a digraph G = (V, E) with a specified subset R(j) of V, its nodes, a branching B(j) rooted at R(j) is a forest in G such that for each node u in V − R(j) there is exactly one edge of B(j) entering u. A branching system B = [B(j): j ∈ J] is a collection of edge-disjoint branchings, with specified root-sets, in G. Given costs c(i) on the edges i of G, and given root sets R(j), we survey the use of matroids to find a least cost branching system, B.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Edmonds, J. (2009). Branching Systems. In: Fiala, J., Kratochvíl, J., Miller, M. (eds) Combinatorial Algorithms. IWOCA 2009. Lecture Notes in Computer Science, vol 5874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10217-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-10217-2_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10216-5
Online ISBN: 978-3-642-10217-2
eBook Packages: Computer ScienceComputer Science (R0)