Space complexity of Euclidean clustering

DOI10.4230/LIPICS.SOCG.2024.82MaRDI QIDQ6895812zbMATH OpenFDO

Authors Xiaoyi Zhu, Yuxiang Tian, Lingxiao Huang, Zengfeng Huang

Publication date 24 November 2025

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

space complexityEuclidean clusteringcoresetterminal embedding

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

This page was built for publication: Space complexity of Euclidean clustering

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