Polymatroid-based capacitated packing of branchings

DOI10.1016/J.DAM.2019.06.014MaRDI QIDQ2334055zbMATH OpenOpenAlexWikidataFDO

Authors Tatsuya Matsuoka, Zoltán Szigeti

Publication date 6 November 2019

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2019.06.014

zbMATH Keywords

arborescence packingarc capacitygraph algorithmpolymatroid

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
• Matroid-Based Packing of Arborescences
• On packing spanning arborescences with matroid constraint
• On packing spanning arborescences with matroid constraint

Cites work

• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Connections in combinatorial optimization
• Geometric algorithms and combinatorial optimization.
• scientific article; zbMATH DE number 3468904 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Matroid-Based Packing of Arborescences
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
• Rooted-tree decompositions with matroid constraints and the infinitesimal rigidity of frameworks with boundaries
• Submodular functions and optimization.

Cited in

(4)

• Packing branchings under cardinality constraints on their root sets
• On packing spanning arborescences with matroid constraint
• The b‐bibranching problem: TDI system, packing, and discrete convexity
• Regular packing of rooted hyperforests with root constraints in hypergraphs

This page was built for publication: Polymatroid-based capacitated packing of branchings

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