Integral packing of branchings in capacitaded digraphs

DOI10.1007/S10878-014-9768-3zbMATH Open1333.90109OpenAlexW2041392158MaRDI QIDQ5963635FDOQ5963635

Authors: Mario Leston-Rey 

Publication date: 23 February 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9768-3

Recommendations

• A faster algorithm for packing branchings in digraphs
• Integral packing of trees and branchings
• scientific article; zbMATH DE number 7378329
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs

zbMATH Keywords

branchingpackingarborescences

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Connections in combinatorial optimization
• On two minimax theorems in graph
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs

Cited In (4)

• Stronger bounds and faster algorithms for packing in generalized kernel systems
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
• Packing in generalized kernel systems: a framework that generalizes packing of branchings
• Packing countably many branchings with prescribed root-sets in infinite digraphs

This page was built for publication: Integral packing of branchings in capacitaded digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963635)