Covering Intersecting Bi-set Families under Matroid Constraints

DOI10.1137/15M1049099zbMath1344.05112MaRDI QIDQ2820858

Yusuke Kobayashi, Tamás Király, Kristóf Bérczi

Publication date: 9 September 2016

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

matroidsintersecting familiespacking arborescencesbi-sets

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Packing of arborescences with matroid constraints via matroid intersection ⋮ On reachability mixed arborescence packing ⋮ On packing spanning arborescences with matroid constraint ⋮ Packing of maximal independent mixed arborescences ⋮ Packing branchings under cardinality constraints on their root sets ⋮ Old and new results on packing arborescences in directed hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on disjoint arborescences
• Arc-disjoint in-trees in directed graphs
• Rooted \(k\)-connections in digraphs
• The ellipsoid method and its consequences in combinatorial optimization
• On two minimax theorems in graph
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
• Variations for Lovász’ Submodular Ideas
• Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries
• Matroid-Based Packing of Arborescences
• Digraphs
• On covering intersecting set-systems by digraphs

This page was built for publication: Covering Intersecting Bi-set Families under Matroid Constraints