Spherical Discrepancy Minimization and Algorithmic Lower Bounds for Covering the Sphere

DOI10.1137/1.9781611975994.53MaRDI QIDQ5146824zbMATH OpenOpenAlexFDO

Authors

Publication date 2 February 2021

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

Full work available at URL https://arxiv.org/abs/1907.05515

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• An efficient search algorithm for minimum covering polygons on the sphere
• scientific article; zbMATH DE number 4108663
• A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes
• A hybrid algorithm for the minimum bounding sphere problem
• New analysis of the sphere covering problems and optimal polytope approximation of convex bodies
• The minimum covering \(l_{pb}\)-hypersphere problem
• Covering a simplex by spheres: complexity and algorithms
• Approximating covering and minimum enclosing balls in hyperbolic geometry
• Minimum-cost coverage of point sets by disks
• The sphere covering inequality and its applications

Cited in

(4)

• Gaussian discrepancy: a probabilistic relaxation of vector balancing
• Algorithmic pure states for the negative spherical perceptron
• Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual
• A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes

This page was built for publication: Spherical Discrepancy Minimization and Algorithmic Lower Bounds for Covering the Sphere

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