# Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut

@article{Chawla2005EmbeddingsON, title={Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut}, author={Shuchi Chawla and Anupam Gupta and Harald R{\"a}cke}, journal={ACM Trans. Algorithms}, year={2005}, volume={4}, pages={22:1-22:18} }

- Published in ACM Trans. Algorithms 2005
DOI:10.1145/1361192.1361199

In this article, we study metrics of <i>negative type</i>, which are metrics (<i>V</i>, d) such that &sqrt;d is an Euclidean metric; these metrics are thus also known as ℓ<sub>2</sub>-squared metrics. We show how to embed <i>n</i>-point negative-type metrics into Euclidean space ℓ<sub>2</sub> with distortion <i>D</i> = <i>O</i>(log<sup>3/4</sup><i>n</i>). This embedding result, in turn, implies an <i>O</i>(log<sup>3/4</sup><i>k</i>)-approximation algorithm for the Sparsest Cut problem with… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 39 CITATIONS

## Fast Approximation Algorithms for Cut-Based Problems in Undirected Graphs

VIEW 14 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## Applications of Metric Embeddings in Solving Combinatorial Problems

VIEW 12 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## Euclidean distortion and the sparsest cut

VIEW 14 EXCERPTS

CITES BACKGROUND, METHODS & RESULTS

HIGHLY INFLUENCED

## Improved Region-Growing and Combinatorial Algorithms for $k$-Route Cut Problems

VIEW 1 EXCERPT

CITES BACKGROUND

## The complexity of expansion problems

VIEW 2 EXCERPTS

## The asymptotic enhanced negative type of finite ultrametric spaces

VIEW 2 EXCERPTS

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-3 OF 3 REFERENCES

## The geometry of graphs and some of its algorithmic applications

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## The Maximum Concurrent Flow Problem

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Geometry of cuts and metrics

VIEW 1 EXCERPT

HIGHLY INFLUENTIAL