CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 20693-21115 JSONTXT

{"target":"https://pubannotation.org/docs/sourcedb/CORD-19/sourceid/6e2db98aa242e3e84116afdfad5e250943c55ac5","sourcedb":"CORD-19","sourceid":"6e2db98aa242e3e84116afdfad5e250943c55ac5","text":"Monitoring k nodes to detect diffusion initiated from U corresponding to sets in a Set Cover solution results in covering all n nodes corresponding to the ground set U, and if any set S of k nodes has D(S) ≤ 1, then the Set Cover problem must be solvable.ᮀ Since the optimization problem is NP-hard and the network is prohibitively large, we cannot compute the optimum value to verify the actual quality of approximations.","tracks":[{"project":"CORD-19_Custom_license_subset","denotations":[{"id":"T156","span":{"begin":0,"end":422},"obj":"Sentence"}],"attributes":[{"subj":"T156","pred":"source","obj":"CORD-19_Custom_license_subset"}]},{"project":"CORD-19-Sentences","denotations":[{"id":"TextSentencer_T156","span":{"begin":0,"end":422},"obj":"Sentence"},{"id":"TextSentencer_T156","span":{"begin":0,"end":422},"obj":"Sentence"},{"id":"T30297","span":{"begin":0,"end":422},"obj":"Sentence"}],"namespaces":[{"prefix":"_base","uri":"http://pubannotation.org/ontology/tao.owl#"}],"attributes":[{"subj":"TextSentencer_T156","pred":"source","obj":"CORD-19-Sentences"},{"subj":"TextSentencer_T156","pred":"source","obj":"CORD-19-Sentences"},{"subj":"T30297","pred":"source","obj":"CORD-19-Sentences"}]},{"project":"Epistemic_Statements","denotations":[{"id":"T63","span":{"begin":0,"end":422},"obj":"Epistemic_statement"}],"attributes":[{"subj":"T63","pred":"source","obj":"Epistemic_Statements"}]}],"config":{"attribute types":[{"pred":"source","value type":"selection","values":[{"id":"CORD-19_Custom_license_subset","color":"#9dec93","default":true},{"id":"CORD-19-Sentences","color":"#ec93b7"},{"id":"Epistemic_Statements","color":"#93d1ec"}]}]}}