From post

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Coresets for constrained k-median and k-means clustering in low dimensional Euclidean space., и . CoRR, (2021)Fair Coresets and Streaming Algorithms for Fair k-means., , и . WAOA, том 11926 из Lecture Notes in Computer Science, стр. 232-251. Springer, (2019)Approximating Fair k-Min-Sum-Radii in Euclidean Space., , , , и . WAOA, том 14297 из Lecture Notes in Computer Science, стр. 119-133. Springer, (2023)Connected k-Center and k-Diameter Clustering., , , , , и . ICALP, том 261 из LIPIcs, стр. 50:1-50:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On the Cost of Essentially Fair Clusterings., , , , , , и . APPROX-RANDOM, том 145 из LIPIcs, стр. 18:1-18:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Noisy, Greedy and Not So Greedy k-means++., , , и . CoRR, (2019)Modeling of dispatching-rules for job shop scheduling in manufacturing systems - a Petri net approach., и . SMC, стр. 2025-2030. IEEE, (2005)Analysis of Ward's Method., , и . SODA, стр. 2939-2957. SIAM, (2019)Noisy, Greedy and Not so Greedy k-Means++., , , и . ESA, том 173 из LIPIcs, стр. 18:1-18:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Upper and Lower Bounds for Complete Linkage in General Metric Spaces., , , , и . APPROX-RANDOM, том 207 из LIPIcs, стр. 18:1-18:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)