Timeline for Finding "fingerprint" sets
Current License: CC BY-SA 3.0
3 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 7, 2012 at 17:27 | comment | added | Patrick87 | See Falk Huffner's answer, where he correctly identifies your problem as the NP-Hard Hitting Set problem. It appears my answer gives the usual greedy approximation for the problem, which isn't bad, but isn't optimal either. | |
Dec 6, 2012 at 17:47 | history | edited | Patrick87 | CC BY-SA 3.0 |
Completed the example.
|
Dec 6, 2012 at 17:31 | history | answered | Patrick87 | CC BY-SA 3.0 |