
CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 36464-36622
Annnotations
CORD-19_Custom_license_subset
{"project":"CORD-19_Custom_license_subset","denotations":[{"id":"T303","span":{"begin":0,"end":158},"obj":"Sentence"}],"text":"We compare the UBG in Algorithm 2, the Quickest-Path-UBG in Algorithm 3, and Local-Reduction-UBG in Algorithm 4 with both the greedy and heuristic algorithms."}
CORD-19-Sentences
{"project":"CORD-19-Sentences","denotations":[{"id":"TextSentencer_T303","span":{"begin":0,"end":158},"obj":"Sentence"},{"id":"TextSentencer_T303","span":{"begin":0,"end":158},"obj":"Sentence"},{"id":"T61542","span":{"begin":0,"end":158},"obj":"Sentence"}],"namespaces":[{"prefix":"_base","uri":"http://pubannotation.org/ontology/tao.owl#"}],"text":"We compare the UBG in Algorithm 2, the Quickest-Path-UBG in Algorithm 3, and Local-Reduction-UBG in Algorithm 4 with both the greedy and heuristic algorithms."}