Before revision: \ge  In addition, we propose a deterministic, multi-pass streaming algorithm with O(1 / \epsilon) passes that achieves ratio 1-1/e - \epsilon in O(n/\epsilon) queries, O(k \log (k)) memory, and O(n) time .
After revision: \ge In addition, we propose a deterministic, multi-pass streaming algorithm with O(1 / \epsilon) passes that achieves nearly the optimal ratio with linear query and time complexities .