Terminal embeddings

Moreover, our embeddings have implications to the areas of Approximation and Online Algorithms. In particular, [10] devised an O˜(log⁡r)-approximation algorithm for sparsest-cut instances with r demands. Building on their framework, we provide an O˜(log⁡|K|)- approximation for sparsest-cut instances in which each demand is incident on one of the vertices of K (aka, terminals). Since |K|≤r, our bound generalizes that of [10].