Faster Matroid Partition Algorithmsdoi:10.1145/3707208Matroid PartitionMatroid UnionCombinatorial OptimizationIn the matroid partitioning problem, we are given k matroids M1=(V,I1),…,Mk=(V,Ik) defined over a common ground set V of n elements, and we need to find a partitionable set SV of ...