Before revision:  }[ . Specifically, our algorithm is deterministic and it achieves an approximation ratio of (1+\epsilon) f and an update time of O\left((f^2/\epsilon^3)+(f/\epsilon^2) \log C\right) .
After revision:  }[ . 2. (1+\epsilon) f and an update time of O\left((f^2/\epsilon^3)+(f/\epsilon^2) \log C\right) .