Probabilistic clustering of high dimensional norms

DOI10.1137/1.9781611974782.44zbMath1410.68376OpenAlexW4248376522MaRDI QIDQ4575781

Assaf Naor

Publication date: 16 July 2018

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Metric spaces, metrizability (54E35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Geometry and structure of normed linear spaces (46B20)

Related Items

Absolute Lipschitz extendability and linear projection constants ⋮ Optimal (Euclidean) Metric Compression ⋮ Impossibility of almost extension ⋮ Unnamed Item

This page was built for publication: Probabilistic clustering of high dimensional norms