Improved bound for the Carathéodory rank of the bases of a matroid
From MaRDI portal
(Redirected from Improved bound for the Carathéodory rank of the bases of a matroid)
Recommendations
Cites work
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- A counterexample to an integer analogue of Carathéodory's theorem
- An Algorithm for Submodular Functions on Graphs
- An integer analogue of Carathéodory's theorem
- Finding feasible vectors of Edmonds-Giles polyhedra
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Matroids and the greedy algorithm
- Minimum partition of a matroid into independent subsets
Cited in
(12)- Invertibility of the base Radon transform of a matroid
- A nonextremal Camion basis
- On greedy bases packing in matroids
- Stronger bounds and faster algorithms for packing in generalized kernel systems
- scientific article; zbMATH DE number 4029587 (Why is no real title available?)
- A faster algorithm for packing branchings in digraphs
- scientific article; zbMATH DE number 1445398 (Why is no real title available?)
- Subdivisions of integral base polytopes
- New Bounds for the Integer Carathéodory Rank
- Bases-cobases graphs and polytopes of matroids
- Integer Carathéodory results with bounded multiplicity
- Polyhedra with the integer Carathéodory property
This page was built for publication: Improved bound for the Carathéodory rank of the bases of a matroid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1400967)
