Euclidean spanners in high dimensions

DOI10.1137/1.9781611973105.57MaRDI QIDQ5741765zbMATH OpenOpenAlexFDO

Authors Anastasios Sidiropoulos, Sariel Har-Peled, Piotr Indyk

Publication date 15 May 2019

Published in Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973105.57

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Optimal Euclidean Spanners
• Optimal Euclidean spanners, really short, thin and lanky
• scientific article; zbMATH DE number 1263225
• Approximating Euclidean distances by small degree graphs

Cited in

(16)

• Light spanners for high dimensional norms via stochastic decompositions
• Terminal embeddings
• Sparse Euclidean Spanners with Tiny Diameter
• Optimal Euclidean Spanners
• Testing Euclidean Spanners
• scientific article; zbMATH DE number 1263225 (Why is no real title available?)
• A Fast Algorithm for Constructing Sparse Euclidean Spanners
• Near-optimal (Euclidean) metric compression
• Light spanners for snowflake metrics
• Light spanners for high dimensional norms via stochastic decompositions
• Online Euclidean Spanners
• Streaming Euclidean MST to a constant factor
• A unified framework for light spanners
• An o(n n)-time approximation scheme for geometric many-to-many matching
• On sparse covers of minor free graphs, low dimensional metric embeddings, and other applications
• Lipschitz decompositions of finite _p metrics

This page was built for publication: Euclidean spanners in high dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741765)