CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 19447-19660 JSONTXT

Annnotations TAB JSON ListView MergeView

    CORD-19_Custom_license_subset

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

    CORD-19-Sentences

    {"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#"}],"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."}

    Epistemic_Statements

    {"project":"Epistemic_Statements","denotations":[{"id":"T57","span":{"begin":68,"end":213},"obj":"Epistemic_statement"}],"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."}