We note that CORPU SPART has a submodular problem structure, where greedy algorithms are often effective.
let |S| denote the vocabulary size of a set of documents S, and let S ⊆ S. Then for any document c the following inequality holds.