On the optimality of gluing over scales

DOI10.1007/s00454-011-9359-3zbMath1219.68159OpenAlexW2788840627MaRDI QIDQ635762

Alexander Jaffe, James R. Lee, Mohammad Moharrami

Publication date: 23 August 2011

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-011-9359-3

zbMATH Keywords

finite metric spacesmetric geometryEuclidean distortion

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Approximation algorithms (68W25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Vertical perimeter versus horizontal perimeter ⋮ Metric Embedding via Shortest Path Decompositions ⋮ On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Volume distortion for subsets of Euclidean spaces
• Sharp uniform convexity and smoothness inequalities for trace norms
• On embedding expanders into \(\ell_p\) spaces
• Embedding the diamond graph in \(L_p\) and dimension reduction in \(L_1\)
• A lower bound on the distortion of embedding planar metrics into Euclidean space
• The geometry of graphs and some of its algorithmic applications
• Measured descent: A new embedding method for finite metrics
• Expander graphs and their applications
• An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
• PLANE WITH $A_{\infty}$ -WEIGHTED METRIC NOT BILIPSCHITZ EMBEDDABLE TO ${\bb R}^n$
• Euclidean distortion and the sparsest cut
• Bilipschitz embeddings of metric spaces into space forms

This page was built for publication: On the optimality of gluing over scales