Net and prune

DOI10.1145/2488608.2488684zbMath1293.68167OpenAlexW2027823875MaRDI QIDQ5495831

Benjamin Raichel, Sariel Har-Peled

Publication date: 7 August 2014

Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

optimizationnetsclusteringlinear time

Mathematics Subject Classification ID

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

Related Items (2)

The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition ⋮ A unified framework for clustering constrained data without locality property

This page was built for publication: Net and prune