No article text was recorded for this version.
hierarchical metric embedding
Version 2 of 2172 papers223 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Probabilistic Metric Embedding via Metric Labeling
- Blog: Fitting Tree Metrics: Hierarchical Clustering and Phylogeny
- Blog: A Polylogarithmic-Competitive Algorithm for the k-Server Problem
- Blog: Capacitated Fair-Range Clustering: Hardness and Approximation Algorithms
- Blog: Online Service with Delay
- Blog: General Framework for Metric Optimization Problems with Delay or with Deadlines
- Blog: Streaming Euclidean Max-Cut: Dimension vs Data Reduction
- Blog: Average-Case Dimensionality Reduction in 𝓁1: Tree Ising Models
- Blog: Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual
- Blog: Scalable Differentially Private Clustering via Hierarchically Separated Trees
- Blog: A Polylogarithmic-Competitive Algorithm for the k-Server Problem
- Blog: An Improved Approximation Ratio for the Covering Steiner Problem
- Blog: Learning representations from dendrograms
- Blog: Approximation Algorithms for Replenishment Problems with Fixed Turnover Times
- Blog: Learning Ultrametric Trees for Optimal Transport Regression
- Blog: Fitting Tree Metrics and Ultrametrics in Data Streams
- Blog: Visualizing and Measuring the Geometry of BERT
- Blog: Constant-Distortion Embeddings of Hausdorff Metrics into Constant-Dimensional l_p Spaces
- Blog: Approximation Algorithms for Hop Constrained and Buy-at-Bulk Network Design via Hop Constrained Oblivious Routing
- Blog: K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance
- Blog: Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor
- Blog: Approximation algorithms for classification problems with pairwise relationships
- Blog: Highway Dimension: a Metric View
- Blog: Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications
- Blog: Survivable Network Design Revisited: Group-Connectivity
- Blog: k-Servers with a Smile: Online Algorithms via Projections
- Blog: From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs
- Blog: k-Servers with a Smile: Online Algorithms via Projections
- Blog: On $p$-metric spaces and the $p$-Gromov-Hausdorff distance
- Blog: Flow-cut gaps and face covers in planar graphs
- Blog: View-Consistent Hierarchical 3D Segmentation Using Ultrametric Feature Fields
- Blog: Hierarchical Correlation Clustering and Tree Preserving Embedding
- Blog: Towards Non-Uniform k-Center with Constant Types of Radii
- Blog: A cohomology-based Gromov-Hausdorff metric approach for quantifying molecular similarity
- Blog: MAP Estimation of Semi-Metric MRFs via Hierarchical Graph Cuts
- Blog: Efficient Online Clustering with Moving Costs
- Blog: Approximating edit distance in near-linear time
- Blog: A Tight Lower Bound for Online Service with Deadlines and Lazy Server
- Blog: Covering Planar Metrics (and Beyond): O(1) Trees Suffice
- Blog: Scalable routing easy as PIE: A practical isometric embedding protocol
- Blog: Approximating k-hop minimum-spanning trees
- Blog: EmbAssi: Embedding Assignment Costs for Similarity Search in Large Graph Databases
- Blog: Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual
- Blog: Fast Unbalanced Optimal Transport on a Tree
- Blog: Fully Dynamic Embedding into $\ell_p$ Spaces
- Blog: Distributionally Robust Newsvendor on a Metric
- Blog: Min-Cost Bipartite Perfect Matching with Delays
- Blog: Hierarchical Clustering: a 0.585 Revenue Approximation
- Blog: The Online k-Taxi Problem
- Blog: Survivable Network Design for Group Connectivity in Low-Treewidth Graphs
- Blog: Matchings in metric spaces, the dual problem and calibrations modulo 2
- Blog: Scalable Fair Clustering
- Blog: PERMUTATION Strikes Back: The Power of Recourse in Online Metric Matching
- Blog: Stochastic k-Server: How Should Uber Work?
- Blog: Routing under Balance
- Blog: Fair Disaster Containment via Graph-Cut Problems
- Blog: Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor
- Blog: Last-Mile Delivery Made Practical: An Efficient Route Planning Framework with Theoretical Guarantees
- Blog: Deep hierarchical embedding for simultaneous modeling of GPCR proteins in a unified metric space
- Blog: Fitting Metrics and Ultrametrics with Minimum Disagreements
Showing 60 of 172 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_hierarchical_metric_embedding_22455796,
title = {hierarchical metric embedding},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/hierarchical-metric-embedding/rdr_2245579622654d008ed6dca25c6a0296},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 2, frozen text):
@misc{lacuna_hierarchical_metric_embedding_22455796_v2,
title = {hierarchical metric embedding},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/hierarchical-metric-embedding/rdr_2245579622654d008ed6dca25c6a0296/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-19},
}