Disjoint bases in a polymatroid
From MaRDI portal
Publication:3055784
Recommendations
- On Disjoint Common Bases in Two Matroids
- Disjoint Bases for a Countable Family of Rank-Finite Matroids
- scientific article; zbMATH DE number 5558259
- Discrete polymatroids
- Partitions of bases into disjoint unions of bases
- Two disjoint independent bases in matroid-graph pairs
- Matroid base polytope decomposition
- Disjoint polymorphism
- Combinatorial bases of polynomials
- Determination of the bases of a splitting matroid
Cites work
- scientific article; zbMATH DE number 2079349 (Why is no real title available?)
- A new multilayered {PCP} and the hardness of hypergraph vertex cover
- A small approximately min-wise independent family of hash functions
- A threshold of ln n for approximating set cover
- An analysis of approximations for maximizing submodular set functions—I
- An analysis of the greedy algorithm for the submodular set covering problem
- Approximating the domatic number
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Lehmans switching game and a theorem of Tutte and Nash-Williams
- Low discrepancy sets yield approximate min-wise independent permutation families
- Min-wise independent permutations
- Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - ε
Cited in
(5)- Disjoint Bases for a Countable Family of Rank-Finite Matroids
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
- NOTE ON THE UNIVERSAL BASES OF A PAIR OF POLYMATROIDS
- Partitions of bases into disjoint unions of bases
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings
This page was built for publication: Disjoint bases in a polymatroid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055784)
