|
|
Boost : |
From: Phlip (pplumlee_at_[hidden])
Date: 2001-03-10 10:26:48
Proclaimed Peter Dimov from the mountaintops:
> 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.
Not at all: For our problem space at work, this feature of Matroids is a
>major< help! ;-)
-- Phlip phlip_cpp_at_[hidden] ============== http://phlip.webjump.com ============== -- Set phasers on illin' --
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk