Packing mixed hyperarborescences

DOI10.1016/J.DISOPT.2023.100811MaRDI QIDQ6957159zbMATH OpenFDO

Authors Zoltán Szigeti

Publication date 16 July 2025

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISOPT.2023.100811

zbMATH Keywords

arborescencemixed hypergraphpacking

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• Arc-disjoint in-trees in directed graphs
• Arc‐disjoint arborescences of digraphs
• Connections in combinatorial optimization
• scientific article; zbMATH DE number 3906513 (Why is no real title available?)
• scientific article; zbMATH DE number 3512137 (Why is no real title available?)
• scientific article; zbMATH DE number 3799695 (Why is no real title available?)
• Matroid-Based Packing of Arborescences
• Minimum cost flow with set-constraints
• Old and new results on packing arborescences in directed hypergraphs
• On maximal independent arborescence packing
• On packing time-respecting arborescences
• On reachability mixed arborescence packing
• On the orientation of graphs and hypergraphs
• Packing of maximal independent mixed arborescences
• Packing of mixed hyperarborescences with flexible roots via matroid intersection
• Packing of spanning mixed arborescences
• Reachability in arborescence packings
• Supermodularity in unweighted graph optimization. I: Branchings and matchings
• Variations for Lovász’ Submodular Ideas

Cited in

(4)

• Approximate cut \& packing ratios for multi-commodity arborescences
• On arborescence packing augmentation in hypergraphs
• Matroid-reachability-based decomposition into arborescences
• Regular packing of rooted hyperforests with root constraints in hypergraphs

This page was built for publication: Packing mixed hyperarborescences

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