Making doubling metrics geodesic

DOI10.1007/s00453-010-9397-xzbMath1213.68454OpenAlexW1971291542MaRDI QIDQ627522

Kunal Talwar, Anupam Gupta

Publication date: 2 March 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-010-9397-x

zbMATH Keywords

metric embeddingsconvex closuredoubling metricsgeodesic metricslow-distortion embeddings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)

Related Items (2)

Bi-Lipschitz embeddings of quasiconformal trees ⋮ Bi-Lipschitz geometry of quasiconformal trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extensions of Lipschitz maps into Banach spaces
• Nearest neighbor queries in metric spaces
• Minimum 0-extensions of graph metrics
• Absolute Lipschitz extendability
• On the nonexistence of bilipschitz parameterizations and geometric problems about \(A_ \infty\)-weights
• The black-box complexity of nearest-neighbor search
• Searching dynamic point sets in spaces with bounded doubling dimension
• Nearest-neighbor-preserving embeddings
• Bypassing the embedding
• Plongements lipschitziens dans ${\bbfR}\sp n$
• Approximation Algorithms for the 0-Extension Problem
• Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
• Trees and Markov convexity

This page was built for publication: Making doubling metrics geodesic