But maximal matroid matching is NP-hard. ;) Approximating the minimum spaning tree weight in subliner time is very unexpected algorithm.
But maximal matroid matching is NP-hard. ;) Approximating the minimum spaning tree weight in subliner time is very unexpected algorithm.