Net and Prune

DOI10.1145/2831230zbMath1426.68273arXiv1409.7425OpenAlexW2235179049MaRDI QIDQ3177751

Benjamin Raichel, Sariel Har-Peled

Publication date: 2 August 2018

Published in: Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

optimizationnetsclusteringlinear time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (8)

A branch-and-bound method for the minimum \(k\)-enclosing ball problem ⋮ Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs ⋮ Clustering with faulty centers ⋮ Improved PTAS for the constrained \(k\)-means problem ⋮ An ETH-Tight Exact Algorithm for Euclidean TSP ⋮ Unnamed Item ⋮ Light Euclidean Spanners with Steiner Points ⋮ High-dimensional approximate \(r\)-nets

This page was built for publication: Net and Prune