Pages that link to "Item:Q3581404"
From MaRDI portal
The following pages link to Euclidean distortion and the sparsest cut (Q3581404):
Displaying 19 items.
- Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (Q295639) (← links)
- Unbalanced graph partitioning (Q372961) (← links)
- On the advantage of overlapping clusters for minimizing conductance (Q472486) (← links)
- A note on multiflows and treewidth (Q834591) (← links)
- An improved approximation ratio for the minimum linear arrangement problem (Q845884) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- \(\ell ^2_2\) spreading metrics for vertex ordering problems (Q848848) (← links)
- Ramsey partitions and proximity data structures (Q997827) (← links)
- Cut problems in graphs with a budget constraint (Q2457298) (← links)
- Fréchet embeddings of negative type metrics (Q2471721) (← links)
- On distance scales, embeddings, and efficient relaxations of the cut cone (Q2921657) (← links)
- Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut (Q2921658) (← links)
- On Khot’s unique games conjecture (Q3109809) (← links)
- Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs (Q4648696) (← links)
- Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut (Q4962715) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
- Euclidean distortion and the sparsest cut (Q5423920) (← links)
- (Q5743436) (← links)
- Advances in metric embedding theory (Q5894374) (← links)
