Improved bound for the Carathéodory rank of the bases of a matroid

DOI10.1016/S0095-8956(03)00034-0zbMath1024.05018OpenAlexW2086203882MaRDI QIDQ1400967

D. Massart

Publication date: 17 August 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0095-8956(03)00034-0

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Stronger bounds and faster algorithms for packing in generalized kernel systems, New Bounds for the Integer Carathéodory Rank, A faster algorithm for packing branchings in digraphs, Polyhedra with the integer Carathéodory property

Cites Work

• Unnamed Item
• Unnamed Item
• Finding feasible vectors of Edmonds-Giles polyhedra
• An integer analogue of Carathéodory's theorem
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
• A counterexample to an integer analogue of Carathéodory's theorem
• An Algorithm for Submodular Functions on Graphs
• Minimum partition of a matroid into independent subsets
• Matroids and the greedy algorithm