Lossless Prioritized Embeddings
From MaRDI portal
Publication:5088604
DOI10.1137/21M1436221zbMath1494.30100OpenAlexW3002374308MaRDI QIDQ5088604
Publication date: 13 July 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/21m1436221
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Lipschitz embedding of finite metric spaces in Hilbert space
- Lower bounds on the distortion of embedding finite metric spaces in graphs
- The geometry of graphs and some of its algorithmic applications
- On the distortion required for embedding finite metric spaces into normed spaces
- Terminal embeddings
- On metric Ramsey-type phenomena
- Prioritized Metric Structures and Embedding
- Extensions of Lipschitz mappings into a Hilbert space
- Sparse Sourcewise and Pairwise Distance Preservers
- Triangulation and embedding using small sets of beacons
- Approximate distance oracles
- Lower-Stretch Spanning Trees
- Plongements lipschitziens dans ${\bbfR}\sp n$
- Graph spanners
- A Graph-Theoretic Game and Its Application to the k-Server Problem
- On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion
- Using Petal-Decompositions to Build a Low Stretch Spanning Tree
- Efficient Algorithms for Constructing Very Sparse Spanners and Emulators
- The 4/3 Additive Spanner Exponent Is Tight
- $(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
- Near Isometric Terminal Embeddings for Doubling Metrics
- Lossless Prioritized Embeddings
- Labelings vs. Embeddings: On Distributed Representations of Distances
- Optimal terminal dimensionality reduction in Euclidean space
- Metric embedding via shortest path decompositions
- Nonlinear dimension reduction via outer Bi-Lipschitz extensions
- Advances in metric embedding theory
- LATIN 2004: Theoretical Informatics
- A tight bound on approximating arbitrary metrics by tree metrics
This page was built for publication: Lossless Prioritized Embeddings
