Boost logo

Boost :

From: Peter Dimov (pdimov_at_[hidden])
Date: 2001-03-10 08:42:41

> I asked the news:sci.math to tell me what matroids are in simple
> terms, but all they said was "Z(S[m]; e^t, 1, 1, 1 ... ) == (1/m!) sigma
> (h E S[m]) e ^ (t lambda[1](h))" blah blah blah.
> You can try reading the thread "What's a matroid?" ;-)

The only thing I recall about matroids is that greedy algorithms are
guaranteed to produce the optimal solution when the graph is a matroid.

Not much of a help, I realize.

Peter Dimov
Multi Media Ltd.

Boost list run by bdawes at, gregod at, cpdaniel at, john at