Transversal matroid intersections and related packings
From MaRDI portal
Publication:4126086
DOI10.1007/BF01580384zbMath0354.90085MaRDI QIDQ4126086
Publication date: 1976
Published in: Mathematical Programming (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90B10: Deterministic network models in operations research
52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Blocking pairs of polyhedra arising from network flows
- An unbounded matroid intersection polyhedron
- Blocking, antiblocking, and pairs of matroids and polymatroids
- On the Problem of Decomposing a Graph into n Connected Factors
- Packing rooted directed cuts in a weighted directed graph
- Transversals and matroid partition
- Minimum partition of a matroid into independent subsets
- Lehmans switching game and a theorem of Tutte and Nash-Williams
- Blocking and anti-blocking pairs of polyhedra
- Matroids and the greedy algorithm
- The Maximum Number of Disjoint Permutations Contained in a Matrix of Zeros and Ones