Before revision:  We also show that our ideas can be extended to be more general techniques, a novel uniform-adaptive sampling method and a sandwich lemma, for solving the general case of MEB with outliers ( i.e., without the stability assumption) and the problem of k-center clustering with outliers. We achieve sub-linear time bi-criteria approximation algorithms for these problems respectively;
After revision:  We also show that our ideas can be extended to be more general techniques, a novel uniform-adaptive sampling method and a sandwich lemma, for solving the general case of MEB with outliers ( i.e., Note that most existing sub-linear time bi-criteria approximation algorithms for these problems respectively;