| Id |
Subject |
Object |
Predicate |
Lexical cue |
| TextSentencer_T174 |
0-177 |
Sentence |
denotes |
For any submodular and monotone function f with f(∅) =0, the problem of finding a set S of size k that maximizes f(S) can be approximated by the greedy algorithm in Algorithm 1. |
| TextSentencer_T174 |
0-177 |
Sentence |
denotes |
For any submodular and monotone function f with f(∅) =0, the problem of finding a set S of size k that maximizes f(S) can be approximated by the greedy algorithm in Algorithm 1. |
| T96673 |
0-177 |
Sentence |
denotes |
For any submodular and monotone function f with f(∅) =0, the problem of finding a set S of size k that maximizes f(S) can be approximated by the greedy algorithm in Algorithm 1. |
