Packing of arborescences with matroid constraints via matroid intersection
DOI10.1007/S10107-019-01377-0zbMATH Open1441.05185OpenAlexW2931146240MaRDI QIDQ2188242FDOQ2188242
Authors: Csaba Király, Zoltán Szigeti, Shin-Ichi Tanigawa 
Publication date: 10 June 2020
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-019-01377-0
Recommendations
Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Signed and weighted graphs (05C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Submodular functions and optimization.
- Connections in combinatorial optimization
- Title not available (Why is that?)
- A THEOREM ON INDEPENDENCE RELATIONS
- Title not available (Why is that?)
- NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS
- Matroids and the greedy algorithm
- Rooted \(k\)-connections in digraphs
- Packing arborescences
- Exact and approximation algorithms for weighted matroid intersection
- Matroid intersection algorithms
- Matroid Intersection
- Title not available (Why is that?)
- Arc-disjoint in-trees in directed graphs
- AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
- On maximal independent arborescence packing
- Matroid-Based Packing of Arborescences
- On packing spanning arborescences with matroid constraint
- Covering intersecting bi-set families under matroid constraints
- Rooted-tree decompositions with matroid constraints and the infinitesimal rigidity of frameworks with boundaries
- Old and new results on packing arborescences in directed hypergraphs
- Blocking optimal \(k\)-arborescences
Cited In (10)
- Old and new results on packing arborescences in directed hypergraphs
- Matroid-Based Packing of Arborescences
- On reachability mixed arborescence packing
- Reachability in arborescence packings
- Packing of maximal independent mixed arborescences
- Two packing problems on \(k\)-matroid trees
- A matroid approach to finding edge connectivity and packing arborescences
- On packing spanning arborescences with matroid constraint
- On packing spanning arborescences with matroid constraint
- Non-submodular maximization with matroid and knapsack constraints
This page was built for publication: Packing of arborescences with matroid constraints via matroid intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2188242)
