Timeline for Covering set problem
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 15, 2012 at 13:44 | comment | added | Brendan McKay | (As JeffE said, this is a hitting set, not a covering set.) It seems that choosing a random hitting set large enough so that the expected number of sets missed is less than 1 also provides an upper bound of the form $O(n\log k/t)$, though surely the constant is worse. | |
| Apr 14, 2012 at 18:14 | answer | added | JeffE | timeline score: 3 | |
| Apr 14, 2012 at 17:23 | history | asked | David Harris | CC BY-SA 3.0 |