Approximating covering and minimum enclosing balls in hyperbolic geometry

DOI10.1007/978-3-319-25040-3_63zbMATH Open1407.68552OpenAlexW2294294273MaRDI QIDQ2807565FDOQ2807565

Authors: Gaëtan Hadjeres, Frank Nielsen 

Publication date: 25 May 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-25040-3_63

Recommendations

• On approximating the Riemannian 1-center
• On approximating the smallest enclosing Bregman Balls
• Packing and Covering δ-Hyperbolic Spaces by Balls
• Approximate minimum enclosing balls in high dimensions using core-sets
• APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING

Mathematics Subject Classification ID

Information theory (general) (94A15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cited In (5)

• On approximating the Riemannian 1-center
• Clustering in Hilbert’s Projective Geometry: The Case Studies of the Probability Simplex and the Elliptope of Correlation Matrices
• The multi-cover persistence of Euclidean balls
• Packing and Covering δ-Hyperbolic Spaces by Balls
• Spherical Discrepancy Minimization and Algorithmic Lower Bounds for Covering the Sphere

This page was built for publication: Approximating covering and minimum enclosing balls in hyperbolic geometry

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