Content deleted Content added
Line 41:
<br />
Where, at step (2) we use a bi-criteria ''(a,b)''-[[approximation algorithm | approximation algorithm]] which outputs at most ''ak'' medians with cost at most ''b'' <math>\forall</math> optimum and at step (3) we run a ''c''-approximation algorithm. The approximation factor of Small-Space() algorithm is ''2c(1+2b)+2b''. We can also generalize it so that it recursively calls itself <math>i</math> times on a successively smaller set of weighted centers.
The actual STREAM algorithm works as follows:
| |||