Before revision:  Specifically, for any c 1, \epsilon > 0, we propose a single-pass , deterministic streaming algorithm with ratio 1/(4c)-\epsilon, query complexity \lceil n / c \rceil + c , memory complexity O(k \log k), and O(n) total running time. As k \infty, the ratio converges to (1 - 1/e)/(c + 1).
After revision:  Specifically, for any c 1, \epsilon > 0, we propose a single-pass , deterministic streaming algorithm with ratio 1/(4c)-\epsilon, query complexity \lceil n / c \rceil + c  \infty, the ratio converges to (1 - 1/e)/(c + 1).