CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 22231-22408 JSONTXT

{"project":"CORD-19_Custom_license_subset","denotations":[{"id":"T174","span":{"begin":0,"end":177},"obj":"Sentence"}],"text":"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."}

{"project":"CORD-19-Sentences","denotations":[{"id":"TextSentencer_T174","span":{"begin":0,"end":177},"obj":"Sentence"},{"id":"TextSentencer_T174","span":{"begin":0,"end":177},"obj":"Sentence"},{"id":"T96673","span":{"begin":0,"end":177},"obj":"Sentence"}],"namespaces":[{"prefix":"_base","uri":"http://pubannotation.org/ontology/tao.owl#"}],"text":"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."}