CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 22580-22755 JSON TXT

Annnotations TAB JSON ListView MergeView

Id	Subject	Object	Predicate	Lexical cue
T176	0-175	Sentence	denotes	It is shown that the algorithm guarantees an approximation ratio of f(S)/f(S * ) ≥ 1 −1/e, where S is the output of the greedy algorithm and S * is the optimal solution [30] .

Id	Subject	Object	Predicate	Lexical cue
TextSentencer_T176	0-175	Sentence	denotes	It is shown that the algorithm guarantees an approximation ratio of f(S)/f(S * ) ≥ 1 −1/e, where S is the output of the greedy algorithm and S * is the optimal solution [30] .
TextSentencer_T176	0-175	Sentence	denotes	It is shown that the algorithm guarantees an approximation ratio of f(S)/f(S * ) ≥ 1 −1/e, where S is the output of the greedy algorithm and S * is the optimal solution [30] .
T26486	0-175	Sentence	denotes	It is shown that the algorithm guarantees an approximation ratio of f(S)/f(S * ) ≥ 1 −1/e, where S is the output of the greedy algorithm and S * is the optimal solution [30] .

Id	Subject	Object	Predicate	Lexical cue
T69	0-175	Epistemic_statement	denotes	It is shown that the algorithm guarantees an approximation ratio of f(S)/f(S * ) ≥ 1 −1/e, where S is the output of the greedy algorithm and S * is the optimal solution [30] .