I googled around was able to think up a little, and Covering is apparently a slightly modified version brute force algorithm for Covering, but I don't think it would've finished running within the lifetime of an NP-complete [ problem.][1]
[1]: http://en.wikipedia.org/wiki/Set_cover_problemthe known universe.