Before revision:  The best previous bound for both problems was amortized O(n\log n)by Cohen-Addad et al. via randomized O(1)-coresets in O(n) space .
After revision:  We also give conditional lower bound on update/query time for any fully-dynamic (4 - \delta)-approximation algorithm for k-means .