Timeline for How to select minimal subsets?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 4, 2017 at 4:14 | comment | added | ciao | Neat. +1....... | |
| Aug 4, 2017 at 2:59 | comment | added | Daniel Lichtblau |
I forgot I had shown an implementation of the BCL method in this elderly thread (we have interns not so much older). So I should add that ListMin is a version of same, though coded in C.
|
|
| Aug 3, 2017 at 16:33 | comment | added | Daniel Lichtblau |
When I saw this question had returned I kind of suspected there might be (1) A ListMin approach and (2) Carl Woll involvement. Re speed, it uses the Bentley-Clarkson-Levine algorithm. I hope others take note of the efficiency and upvote.
|
|
| Aug 3, 2017 at 5:23 | history | answered | Carl Woll | CC BY-SA 3.0 |