CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 19515-19660 JSONTXT

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