2 ms·
But maximal matroid matching is NP-hard. ;) Approximating the minimum spaning tree weight in subliner time is very unexpected algorithm.
by mikleb 16y ago
But maximal matroid matching is NP-hard. ;)
Approximating the minimum spaning tree weight in subliner time
is very unexpected algorithm.