Size constrained weighted set cover problem to find top N sets while
maximizing the coverage of all elements.
Usage
weightedSetCover(idsInSet, costs, topN, nThreads = 4)
Arguments
- idsInSet
A list of set names and their member IDs.
- costs
A vector of the same length to add weights for penalty, i.e. 1/-logP.
- topN
The number of sets (or less when it completes early) to return.
- nThreads
The number of processes to use. In Windows, it fallbacks to 1.
Value
A list of topSets and coverage.
- topSets
A list of set IDs.
- coverage
The percentage of IDs covered in the top sets.
Author
Zhiao Shi, Yuxing Liao
