Before revision:  Based on some novel observations, we show that this greedy strategy actually can handle k-center /median/means clustering with outliers efficiently, in terms of qualities and complexities .
After revision:  Based on some novel observations, we show that this greedy strategy actually can handle k-center /median/means clustering with outliers efficiently, in terms of clustering quality and time complexity .