The provably good parallel seeding algorithms for the k-means problem with penalties
Year of publication: |
2022
|
---|---|
Authors: | Li, Min ; Xu, Dachuan ; Zhang, Dongmei ; Zhou, Huiling |
Published in: |
International transactions in operational research : a journal of the International Federation of Operational Research Societies. - Oxford : Wiley-Blackwell, ISSN 1475-3995, ZDB-ID 2019815-2. - Vol. 29.2022, 1, p. 158-171
|
Subject: | approximation algorithm | k-means | k-means problem with penalties | parallel seeding algorithm | Algorithmus | Algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
An LP-based k-means algorithm for balancing weighted point sets
Borgwardt, S., (2017)
-
Model-free assortment pricing with transaction data
Chen, Ningyuan, (2023)
-
Adaptive two-stage stochastic programming with an analysis on capacity expansion planning problem
Basciftci, Beste, (2024)
- More ...
-
The provably good parallel seeding algorithms for the<i>k</i>‐means problem with penalties
Li, Min, (2020)
-
Yu, Weina, (2024)
-
DRAPE : optimizing private data release under adjustable privacy-utility equilibrium
Xiong, Qingyue, (2024)
- More ...