Local global tradeoffs in metric embeddings
From MaRDI portal
Publication:3068641
Recommendations
Cited in
(16)- Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics
- On linear and semidefinite programming relaxations for hypergraph matching
- On \(L_1\)-embeddability of unions of \(L_1\)-embeddable metric spaces and of twisted unions of hypercubes
- An introduction to the Ribe program
- Sherali-Adams strikes back
- Polynomial integrality gaps for strong SDP relaxations of densest \(k\)-subgraph
- Local embeddings of metric spaces
- Local embeddings of metric spaces
- Local versus global properties of metric spaces
- From weak to strong linear programming gaps for all constraint satisfaction problems
- A local search algorithm for radius-constrained \(k\)-median
- Approximation Limits of Linear Programs (Beyond Hierarchies)
- Union of Euclidean metric spaces is Euclidean
- Inapproximability for metric embeddings into $\mathbb{R}^{d}$
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut
- Sherali-adams strikes back
This page was built for publication: Local global tradeoffs in metric embeddings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3068641)