Smallest enclosing ball for probabilistic data

DOI10.1145/2582112.2582114MaRDI QIDQ4635545zbMATHOpenAlexFDO

Authors Alexander Munteanu, Christian Sohler, Dan Feldman

Publication date 23 April 2018

Published in Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2582112.2582114

zbMATH Keywords

sampling1-mediansmallest enclosing ballprobabilistic data

Mathematics Subject Classification ID

Directional data; spatial statistics (62H11) Geometric probability and stochastic geometry (60D05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 2079414
• APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
• Computational Science and Its Applications – ICCSA 2004
• THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
• The smallest enclosing ball of balls: combinatorial structure and algorithms

Cited in

(7)

• Clustering with faulty centers
• Maximum box problem on stochastic points
• Probabilistic smallest enclosing ball in high dimensions via subgradient sampling
• Maximizing expected utility for stochastic combinatorial optimization problems
• Visibility testing and counting for uncertain segments
• Snell envelope with small probability criteria
• Approximation algorithms for stochastic combinatorial optimization problems

This page was built for publication: Smallest enclosing ball for probabilistic data

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