Pages that link to "Item:Q4651539"
From MaRDI portal
The following pages link to Approximation Algorithms for the 0-Extension Problem (Q4651539):
Displayed 18 items.
- Making doubling metrics geodesic (Q627522) (← links)
- Random martingales and localization of maximal inequalities (Q982510) (← links)
- Ramsey partitions and proximity data structures (Q997827) (← links)
- Metric decompositions of path-separable graphs (Q1679219) (← links)
- Quasimetric embeddings and their applications (Q1799224) (← links)
- Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem (Q1932671) (← links)
- Maximum gradient embeddings and monotone clustering (Q1945290) (← links)
- On \(L_1\)-embeddability of unions of \(L_1\)-embeddable metric spaces and of twisted unions of hypercubes (Q2087476) (← links)
- Light spanners for high dimensional norms via stochastic decompositions (Q2088589) (← links)
- Partitioning a graph into small pieces with applications to path transversal (Q2316611) (← links)
- On Lipschitz extension from finite subsets (Q2357002) (← links)
- Terminal embeddings (Q2405893) (← links)
- Steiner Point Removal with Distortion $O(\log {k})$ using the Relaxed-Voronoi Algorithm (Q4634019) (← links)
- Simplex Transformations and the Multiway Cut Problem (Q5000653) (← links)
- (Q5009588) (← links)
- Retracting Graphs to Cycles (Q5091228) (← links)
- Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs (Q5232322) (← links)
- (Q5875457) (← links)