暂无分享,去创建一个
[1] Vijay V. Vazirani,et al. Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.
[2] Silvio Lattanzi,et al. A Better k-means++ Algorithm via Local Search , 2019, ICML.
[3] Vincent Cohen-Addad,et al. Approximation Schemes for Capacitated Clustering in Doubling Metrics , 2018, SODA.
[4] Václav Rozhon,et al. K-means++: Few More Steps Yield Constant Approximation , 2020, ICML.
[5] Yi Yang,et al. Balanced Clustering via Exclusive Lasso: A Pragmatic Approach , 2018, AAAI.
[6] Xuelong Li,et al. Balanced Clustering with Least Square Regression , 2017, AAAI.
[7] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[8] Jason Li,et al. On the Fixed-Parameter Tractability of Capacitated Clustering , 2022, ICALP.
[9] Sergei Vassilvitskii,et al. Scalable K-Means++ , 2012, Proc. VLDB Endow..
[10] Andreas Krause,et al. Approximate K-Means++ in Sublinear Time , 2016, AAAI.
[11] Zhu He,et al. Balanced Clustering: A Uniform Model and Fast Algorithm , 2019, IJCAI.
[12] S. P. Lloyd,et al. Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.
[13] Rolf H. Möhring,et al. A constant FPT approximation algorithm for hard-capacitated k-means , 2019 .
[14] M. Inaba. Application of weighted Voronoi diagrams and randomization to variance-based k-clustering , 1994, SoCG 1994.
[15] Sergei Vassilvitskii,et al. k-means++: the advantages of careful seeding , 2007, SODA '07.
[16] Philip S. Yu,et al. Top 10 algorithms in data mining , 2007, Knowledge and Information Systems.
[17] Ravishankar Krishnaswamy,et al. The Hardness of Approximation of Euclidean k-Means , 2015, SoCG.