Polymatroid-based capacitated packing of branchings
From MaRDI portal
Publication:2334055
DOI10.1016/j.dam.2019.06.014zbMath1426.05167OpenAlexW2954576846WikidataQ127616999 ScholiaQ127616999MaRDI QIDQ2334055
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
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs
- Geometric algorithms and combinatorial optimization.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Submodular functions and optimization.
- Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries
- Matroid-Based Packing of Arborescences