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 50 items.
- Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (Q295639) (← links)
- New approximation algorithms for the unsplittable capacitated facility location problem (Q300454) (← links)
- Optimal random matchings, tours, and spanning trees in hierarchically separated trees (Q388460) (← links)
- Optimal cuts and partitions in tree metrics in polynomial time (Q396629) (← links)
- Collective additive tree spanners for circle graphs and polygonal graphs (Q444436) (← links)
- Shifting strategy for geometric graphs without geometry (Q454249) (← links)
- On the efficiency of routing in sensor networks (Q455964) (← links)
- Sublinear time algorithms for earth mover's distance (Q633770) (← links)
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median (Q666661) (← links)
- Approximating snowflake metrics by trees (Q723016) (← links)
- Strategies for parallel unaware cleaners (Q896136) (← links)
- Randomized oblivious integral routing for minimizing power cost (Q897952) (← links)
- Enhanced negative type for finite metric trees (Q924649) (← links)
- Algorithms for the universal and a priori TSP (Q924875) (← links)
- Approximating \(k\)-hop minimum spanning trees in Euclidean metrics (Q963410) (← links)
- On metric clustering to minimize the sum of radii (Q970610) (← links)
- Low-light trees, and tight lower bounds for Euclidean spanners (Q972609) (← links)
- On the graph turnpike problem (Q989483) (← links)
- Volume distortion for subsets of Euclidean spaces (Q1016538) (← links)
- Improved approximation algorithms for the single-sink buy-at-bulk network design problems (Q1026237) (← links)
- Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete (Q1077168) (← links)
- Low dimensional embeddings of ultrametrics. (Q1422397) (← links)
- On approximating planar metrics by tree metrics. (Q1603386) (← links)
- Mixed Hölder matrix discovery via wavelet shrinkage and Calderón-Zygmund decompositions (Q1669061) (← links)
- A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs (Q1679508) (← links)
- Hardness and approximation of the asynchronous border minimization problem (Q1682885) (← links)
- The mixed Lipschitz space and its dual for tree metrics (Q1742818) (← links)
- Extending Lipschitz functions via random metric partitions (Q1770278) (← links)
- Quasimetric embeddings and their applications (Q1799224) (← links)
- Absolute Lipschitz extendability (Q1876864) (← links)
- Spanners of bounded degree graphs (Q1944059) (← links)
- Maximum gradient embeddings and monotone clustering (Q1945290) (← links)
- Affine and projective tree metric theorems (Q1950414) (← links)
- Analysis on Laakso graphs with application to the structure of transportation cost spaces (Q2055392) (← links)
- Light spanners for high dimensional norms via stochastic decompositions (Q2088589) (← links)
- To close is easier than to open: dual parameterization to \(k\)-median (Q2117693) (← links)
- Bounded-degree light approximate shortest-path trees in doubling metrics (Q2235274) (← links)
- Online and offline algorithms for the sorting buffers problem on the line metric (Q2266935) (← links)
- Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
- Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
- Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs (Q2349859) (← links)
- A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem (Q2357170) (← links)
- New length bounds for cycle bases (Q2380021) (← links)
- Approximating \(k\)-hop minimum-spanning trees (Q2488210) (← links)
- The polymatroid Steiner problems (Q2569165) (← links)
- A greedy approximation algorithm for the group Steiner problem (Q2581556) (← links)
- A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem (Q2632008) (← links)
- The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme (Q2817793) (← links)
- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753) (← links)
- Approximability of unsplittable shortest path routing problems (Q3057101) (← links)
