Matroid Base Packings: Improved Dynamic Matroid Density and Combinatorics of Tree Packings

Pavel Arkhipov, Vladimir Kolmogorov

Greedy minimum-weight spanning tree packings are an important tool in graph connectivity algorithms. We study the corresponding process of greedy base packing in matroids, followin…