Bi-criteria linear-time approximations for generalized k-mean/median/center
From MaRDI portal
Publication:3602852
DOI10.1145/1247069.1247073zbMath1221.68270OpenAlexW2145529614MaRDI QIDQ3602852
Dan Feldman, Danny Segev, Micha Sharir, Amos Fiat
Publication date: 12 February 2009
Published in: Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1247069.1247073
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (6)
Approximation algorithms for orthogonal line centers ⋮ Unnamed Item ⋮ Core-Sets: Updated Survey ⋮ Approximation algorithms for orthogonal line centers ⋮ Learning big (image) data via coresets for dictionaries ⋮ Unnamed Item
This page was built for publication: Bi-criteria linear-time approximations for generalized k-mean/median/center
