Before revision:  STOC `17 designed a deterministic \Theta(\log m )-approximation algorithm for this problem that has an update time of O(f \log m) .
After revision:  STOC `17 designed a deterministic \Theta(\log m )-approximation algorithm with O(f \log m) .