The following pages link to Bypassing the embedding (Q3580975):
Displaying 17 items.
- Low-Distortion Inference of Latent Similarities from a Multiplex Social Network (Q5255011) (← links)
- A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q5376438) (← links)
- A PTAS for the Steiner Forest Problem in Doubling Metrics (Q5376440) (← links)
- On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$ (Q5499733) (← links)
- On Hop-Constrained Steiner Trees in Tree-Like Metrics (Q5864216) (← links)
- (Q5874516) (← links)
- Small hop-diameter sparse spanners for doubling metrics (Q5901493) (← links)
- Travelling on graphs with small highway dimension (Q5925522) (← links)
- (Q6124766) (← links)
- A Modern View on Stability of Approximation (Q6163638) (← links)
- Vertex Fault-Tolerant Geometric Spanners for Weighted Points (Q6173263) (← links)
- Vertex fault-tolerant spanners for weighted points in polygonal domains (Q6174157) (← links)
- Approximation algorithms for fair \(k\)-median problem without fairness violation (Q6185845) (← links)
- A data-dependent approach for high-dimensional (robust) Wasserstein alignment (Q6579774) (← links)
- A PTAS framework for clustering problems in doubling metrics (Q6591490) (← links)
- Routing on heavy path WSPD spanners (Q6600811) (← links)
- Approximation schemes for Min-Sum \(k\)-Clustering (Q6670503) (← links)
