CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 19447-19660 JSONTXT

{"target":"https://pubannotation.org/docs/sourcedb/CORD-19/sourceid/6e2db98aa242e3e84116afdfad5e250943c55ac5","sourcedb":"CORD-19","sourceid":"6e2db98aa242e3e84116afdfad5e250943c55ac5","text":"In this section we first show the NP-hardness of DTM problem in Eq. (6), as it can be shown to contain the Set Cover problem as a simple special case, then we propose a simple greedy algorithm for the DTM problem.","tracks":[{"project":"CORD-19_Custom_license_subset","denotations":[{"id":"T147","span":{"begin":0,"end":213},"obj":"Sentence"}],"attributes":[{"subj":"T147","pred":"source","obj":"CORD-19_Custom_license_subset"}]},{"project":"CORD-19-Sentences","denotations":[{"id":"TextSentencer_T147","span":{"begin":0,"end":213},"obj":"Sentence"},{"id":"TextSentencer_T147","span":{"begin":0,"end":213},"obj":"Sentence"},{"id":"T91692","span":{"begin":0,"end":213},"obj":"Sentence"}],"namespaces":[{"prefix":"_base","uri":"http://pubannotation.org/ontology/tao.owl#"}],"attributes":[{"subj":"TextSentencer_T147","pred":"source","obj":"CORD-19-Sentences"},{"subj":"TextSentencer_T147","pred":"source","obj":"CORD-19-Sentences"},{"subj":"T91692","pred":"source","obj":"CORD-19-Sentences"}]},{"project":"Epistemic_Statements","denotations":[{"id":"T57","span":{"begin":68,"end":213},"obj":"Epistemic_statement"}],"attributes":[{"subj":"T57","pred":"source","obj":"Epistemic_Statements"}]}],"config":{"attribute types":[{"pred":"source","value type":"selection","values":[{"id":"CORD-19_Custom_license_subset","color":"#93ecc6","default":true},{"id":"CORD-19-Sentences","color":"#ecac93"},{"id":"Epistemic_Statements","color":"#9394ec"}]}]}}