Pages that link to "Item:Q5901089"
From MaRDI portal
The following pages link to A tight bound on approximating arbitrary metrics by tree metrics (Q5901089):
Displaying 28 items.
- Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs (Q3088084) (← links)
- Streaming Embeddings with Slack (Q3183478) (← links)
- Low Distortion Delaunay Embedding of Trees in Hyperbolic Plane (Q3223968) (← links)
- Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median (Q3448778) (← links)
- A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q3448808) (← links)
- Serving Online Requests with Mobile Servers (Q3459911) (← links)
- On Metric Clustering to Minimize the Sum of Radii (Q3512466) (← links)
- Survey on Oblivious Routing Strategies (Q3576074) (← links)
- Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford (Q4625664) (← links)
- Using Petal-Decompositions to Build a Low Stretch Spanning Tree (Q4629391) (← links)
- Local Search Yields a PTAS for $k$-Means in Doubling Metrics (Q4634026) (← links)
- Approximating Unique Games Using Low Diameter Graph Decomposition (Q5002621) (← links)
- (Q5009588) (← links)
- Constant-Factor FPT Approximation for Capacitated k-Median (Q5075732) (← links)
- Efficient construction of probabilistic tree embeddings (Q5111356) (← links)
- Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (Q5210996) (← links)
- Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion (Q5252661) (← links)
- Additive Spanners for Circle Graphs and Polygonal Graphs (Q5302048) (← links)
- A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q5376438) (← links)
- Euclidean distortion and the sparsest cut (Q5423920) (← links)
- Collective Additive Tree Spanners of Homogeneously Orderable Graphs (Q5458559) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479364) (← links)
- Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones (Q5502177) (← links)
- (Q5743493) (← links)
- Advances in metric embedding theory (Q5894374) (← links)
- A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)
- Local embeddings of metric spaces (Q5919791) (← links)
- On the Facility Location Problem in Online and Dynamic Models. (Q6084398) (← links)
