Improved bound for the Carathéodory rank of the bases of a matroid
type: Item
instance of: scholarly article
title: Improved bound for the Carathéodory rank of the bases of a matroid
zbMATH Open document ID: 1024.05018
DOI: 10.1016/S0095-8956(03)00034-0
author: D. Massart
published in: Journal of Combinatorial Theory. Series B
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 1965037
MaRDI profile type: Publication
cites work: A counterexample to an integer analogue of Carathéodory's theorem
cites work: An integer analogue of Carathéodory's theorem
cites work: Minimum partition of a matroid into independent subsets
cites work: Q5684698
cites work: Matroids and the greedy algorithm
cites work: An Algorithm for Submodular Functions on Graphs
cites work: Finding feasible vectors of Edmonds-Giles polyhedra
cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
cites work: Q3818127
cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
full work available at URL: s0095-8956(03)00034-0
OpenAlex ID: W2086203882
description: scientific article; zbMATH DE number 1965037