Pages that link to "Item:Q2921657"
From MaRDI portal
The following pages link to On distance scales, embeddings, and efficient relaxations of the cut cone (Q2921657):
Displaying 22 items.
- Markov type and threshold embeddings (Q359547) (← links)
- On the advantage of overlapping clusters for minimizing conductance (Q472486) (← links)
- On a class of metrics related to graph layout problems (Q603106) (← links)
- On the optimality of gluing over scales (Q635762) (← links)
- An improved approximation ratio for the minimum linear arrangement problem (Q845884) (← links)
- \(\ell ^2_2\) spreading metrics for vertex ordering problems (Q848848) (← links)
- Volume distortion for subsets of Euclidean spaces (Q1016538) (← links)
- A divide-and-conquer strategy for embedding a distance-net point set into \(E^ n\) and its application (Q1344421) (← links)
- Vertical perimeter versus horizontal perimeter (Q1643390) (← links)
- Fréchet embeddings of negative type metrics (Q2471721) (← links)
- Quasisymmetric embeddings, the observable diameter, and expansion properties of graphs (Q2573422) (← links)
- Sharpening the distance conjecture in diverse dimensions (Q2694386) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- Bilipschitz snowflakes and metrics of negative type (Q2875189) (← links)
- Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut (Q2921658) (← links)
- Euclidean distortion and the sparsest cut (Q3581404) (← links)
- Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut (Q4962715) (← links)
- Approximating sparsest cut in low rank graphs via embeddings from approximately low-dimensional spaces (Q5002624) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
- On the Structure of Isometrically Embeddable Metric Spaces (Q5071129) (← links)
- Comparison of Metric Spectral Gaps (Q5402099) (← links)
- Euclidean distortion and the sparsest cut (Q5423920) (← links)
