Kalczynski, Pawel; Brimberg, Jack; Drezner, Zvi Less is more: simple algorithms for the minimum sum of squares clustering problem. (English) Zbl 07564441 IMA J. Manag. Math. 33, No. 3, 531-548 (2022). MSC: 90-XX 91-XX PDF BibTeX XML Cite \textit{P. Kalczynski} et al., IMA J. Manag. Math. 33, No. 3, 531--548 (2022; Zbl 07564441) Full Text: DOI OpenURL
Onn, Shmuel The complexity of vector partition. (English) Zbl 07557646 Vietnam J. Math. 50, No. 3, 707-718 (2022). MSC: 68Q17 68Q27 68Uxx 68Wxx 90C27 90C10 15Axx 51Mxx 52Axx 52Bxx 52Cxx 62Hxx PDF BibTeX XML Cite \textit{S. Onn}, Vietnam J. Math. 50, No. 3, 707--718 (2022; Zbl 07557646) Full Text: DOI OpenURL
Calamoneri, Tiziana; Sinaimeri, Blerina Some problems related to the space of optimal tree reconciliations (invited talk). (English) Zbl 07556556 Mutzel, Petra (ed.) et al., WALCOM: algorithms and computation. 16th international conference and workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13174, 3-14 (2022). MSC: 68Wxx PDF BibTeX XML Cite \textit{T. Calamoneri} and \textit{B. Sinaimeri}, Lect. Notes Comput. Sci. 13174, 3--14 (2022; Zbl 07556556) Full Text: DOI OpenURL
Gouvêa, Alessandra M. M. M.; Rubido, Nicolás; Macau, Elbert E. N.; Quiles, Marcos G. Importance of numerical implementation and clustering analysis in force-directed algorithms for accurate community detection. (English) Zbl 07555043 Appl. Math. Comput. 431, Article ID 127310, 21 p. (2022). MSC: 05Cxx 91Dxx 62-XX PDF BibTeX XML Cite \textit{A. M. M. M. Gouvêa} et al., Appl. Math. Comput. 431, Article ID 127310, 21 p. (2022; Zbl 07555043) Full Text: DOI OpenURL
Deng, Shichuan On clustering with discounts. (English) Zbl 07537431 Inf. Process. Lett. 177, Article ID 106272, 9 p. (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{S. Deng}, Inf. Process. Lett. 177, Article ID 106272, 9 p. (2022; Zbl 07537431) Full Text: DOI OpenURL
Bhattacharya, Anup; Freund, Yoav; Jaiswal, Ragesh On the \(k\)-means/median cost function. (English) Zbl 07537418 Inf. Process. Lett. 177, Article ID 106252, 8 p. (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{A. Bhattacharya} et al., Inf. Process. Lett. 177, Article ID 106252, 8 p. (2022; Zbl 07537418) Full Text: DOI OpenURL
Abam, Mohammad Ali; de Berg, Mark; Farahzad, Sina; Haji Mirsadeghi, Mir Omid; Saghafian, Morteza Preclustering algorithms for imprecise points. (English) Zbl 07535641 Algorithmica 84, No. 6, 1467-1489 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{M. A. Abam} et al., Algorithmica 84, No. 6, 1467--1489 (2022; Zbl 07535641) Full Text: DOI OpenURL
Abdalla, Pedro; Bandeira, Afonso S. Community detection with a subsampled semidefinite program. (English) Zbl 07533934 Sampl. Theory Signal Process. Data Anal. 20, No. 1, Paper No. 6, 10 p. (2022). MSC: 90C22 05C82 94A15 PDF BibTeX XML Cite \textit{P. Abdalla} and \textit{A. S. Bandeira}, Sampl. Theory Signal Process. Data Anal. 20, No. 1, Paper No. 6, 10 p. (2022; Zbl 07533934) Full Text: DOI OpenURL
Dumitrescu, Adrian; Tóth, Csaba D. Online unit clustering and unit covering in higher dimensions. (English) Zbl 07517133 Algorithmica 84, No. 5, 1213-1231 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{A. Dumitrescu} and \textit{C. D. Tóth}, Algorithmica 84, No. 5, 1213--1231 (2022; Zbl 07517133) Full Text: DOI OpenURL
Makarychev, Konstantin; Makarychev, Yury; Razenshteyn, Ilya Performance of Johnson-Lindenstrauss transform for \(k\)-means and \(k\)-medians clustering. (English) Zbl 1483.68311 SIAM J. Comput. 51, No. 2, STOC19-269-STOC19-297 (2022). MSC: 68T05 62H30 68R12 PDF BibTeX XML Cite \textit{K. Makarychev} et al., SIAM J. Comput. 51, No. 2, STOC19--269-STOC19--297 (2022; Zbl 1483.68311) Full Text: DOI OpenURL
Jia, Xinrui; Sheth, Kshiteej; Svensson, Ola Fair colorful \(k\)-center clustering. (English) Zbl 07495423 Math. Program. 192, No. 1-2 (B), 339-360 (2022). MSC: 68W40 PDF BibTeX XML Cite \textit{X. Jia} et al., Math. Program. 192, No. 1--2 (B), 339--360 (2022; Zbl 07495423) Full Text: DOI OpenURL
Anegg, Georg; Angelidakis, Haris; Kurpisz, Adam; Zenklusen, Rico A technique for obtaining true approximations for \(k\)-center with covering constraints. (English) Zbl 07495410 Math. Program. 192, No. 1-2 (B), 3-27 (2022). MSC: 90C27 68W40 68Q25 PDF BibTeX XML Cite \textit{G. Anegg} et al., Math. Program. 192, No. 1--2 (B), 3--27 (2022; Zbl 07495410) Full Text: DOI OpenURL
Alshabeeb, Israa Ali; Azeez, Ruaa Majeed; Shakir, Wafaa Mohammed Ridha Machine learning techniques and forecasting methods for analyzing and predicting Covid-19. (English) Zbl 07491378 Int. J. Math. Comput. Sci. 17, No. 1, 413-424 (2022). MSC: 68Q25 62M10 60G25 68W40 62H30 PDF BibTeX XML Cite \textit{I. A. Alshabeeb} et al., Int. J. Math. Comput. Sci. 17, No. 1, 413--424 (2022; Zbl 07491378) Full Text: Link OpenURL
Lee, Euiwoong; Nagarajan, Viswanath; Wang, Lily On some variants of Euclidean \(k\)-supplier. (English) Zbl 07487773 Oper. Res. Lett. 50, No. 2, 115-121 (2022). MSC: 90-XX PDF BibTeX XML Cite \textit{E. Lee} et al., Oper. Res. Lett. 50, No. 2, 115--121 (2022; Zbl 07487773) Full Text: DOI arXiv OpenURL
Bandyapadhyay, Sayan On perturbation resilience of non-uniform \(k\)-center. (English) Zbl 07467497 Algorithmica 84, No. 1, 13-36 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{S. Bandyapadhyay}, Algorithmica 84, No. 1, 13--36 (2022; Zbl 07467497) Full Text: DOI arXiv OpenURL
Wang, Jiabing; Chen, Jiaye Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints. (English) Zbl 07467478 Theor. Comput. Sci. 905, 54-68 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{J. Wang} and \textit{J. Chen}, Theor. Comput. Sci. 905, 54--68 (2022; Zbl 07467478) Full Text: DOI OpenURL
Akay, Özlem; Yüksel, Güzin Hierarchical clustering of mixed variable panel data based on new distance. (English) Zbl 07545632 Commun. Stat., Simulation Comput. 50, No. 6, 1695-1710 (2021). MSC: 62-XX PDF BibTeX XML Cite \textit{Ö. Akay} and \textit{G. Yüksel}, Commun. Stat., Simulation Comput. 50, No. 6, 1695--1710 (2021; Zbl 07545632) Full Text: DOI OpenURL
Mirzal, Andri A convergent algorithm for bi-orthogonal nonnegative matrix tri-factorization. (English) Zbl 07538940 Adv. Data Anal. Classif., ADAC 15, No. 4, 1069-1102 (2021). MSC: 65F30 15A23 PDF BibTeX XML Cite \textit{A. Mirzal}, Adv. Data Anal. Classif., ADAC 15, No. 4, 1069--1102 (2021; Zbl 07538940) Full Text: DOI OpenURL
Öner, Yüksel; Bulut, Hasan A robust EM clustering approach: ROBEM. (English) Zbl 07532158 Commun. Stat., Theory Methods 50, No. 19, 4587-4605 (2021). MSC: 62-XX PDF BibTeX XML Cite \textit{Y. Öner} and \textit{H. Bulut}, Commun. Stat., Theory Methods 50, No. 19, 4587--4605 (2021; Zbl 07532158) Full Text: DOI OpenURL
Kulczycki, Piotr; Franus, Krystian Methodically unified procedures for a conditional approach to outlier detection, clustering, and classification. (English) Zbl 1484.62078 Inf. Sci. 560, 504-527 (2021). MSC: 62H30 PDF BibTeX XML Cite \textit{P. Kulczycki} and \textit{K. Franus}, Inf. Sci. 560, 504--527 (2021; Zbl 1484.62078) Full Text: DOI OpenURL
Kuo, R. J.; Zheng, Y. R.; Nguyen, Thi Phuong Quyen Metaheuristic-based possibilistic fuzzy \(k\)-modes algorithms for categorical data clustering. (English) Zbl 1484.62079 Inf. Sci. 557, 1-15 (2021). MSC: 62H30 62H86 68W50 PDF BibTeX XML Cite \textit{R. J. Kuo} et al., Inf. Sci. 557, 1--15 (2021; Zbl 1484.62079) Full Text: DOI OpenURL
Zhao, Xingwang; Liang, Jiye; Wang, Jie A community detection algorithm based on graph compression for large-scale social networks. (English) Zbl 1486.91071 Inf. Sci. 551, 358-372 (2021). MSC: 91D30 05C85 PDF BibTeX XML Cite \textit{X. Zhao} et al., Inf. Sci. 551, 358--372 (2021; Zbl 1486.91071) Full Text: DOI OpenURL
Friggstad, Zachary; Mousavi, Ramin Fair correlation clustering with global and local guarantees. (English) Zbl 07498693 Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 414-427 (2021). MSC: 68P05 68Wxx PDF BibTeX XML Cite \textit{Z. Friggstad} and \textit{R. Mousavi}, Lect. Notes Comput. Sci. 12808, 414--427 (2021; Zbl 07498693) Full Text: DOI OpenURL
Fomin, Fedor V.; Golovach, Petr A.; Purohit, Nidhi Parameterized complexity of categorical clustering with size constraints. (English) Zbl 07498691 Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 385-398 (2021). MSC: 68P05 68Wxx PDF BibTeX XML Cite \textit{F. V. Fomin} et al., Lect. Notes Comput. Sci. 12808, 385--398 (2021; Zbl 07498691) Full Text: DOI OpenURL
Manghiuc, Bogdan-Adrian Distributed detection of clusters of arbitrary size. (English) Zbl 07495150 Jurdziński, Tomasz (ed.) et al., Structural information and communication complexity. 28th international colloquium, SIROCCO 2021, Wrocław, Poland, June 28 – July 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12810, 370-387 (2021). MSC: 68Mxx 68Q11 68R10 PDF BibTeX XML Cite \textit{B.-A. Manghiuc}, Lect. Notes Comput. Sci. 12810, 370--387 (2021; Zbl 07495150) Full Text: DOI OpenURL
Luo, Yu; Stephens, David A. Bayesian inference for continuous-time hidden Markov models with an unknown number of states. (English) Zbl 1475.62047 Stat. Comput. 31, No. 5, Paper No. 57, 15 p. (2021). MSC: 62-08 62F15 62M05 PDF BibTeX XML Cite \textit{Y. Luo} and \textit{D. A. Stephens}, Stat. Comput. 31, No. 5, Paper No. 57, 15 p. (2021; Zbl 1475.62047) Full Text: DOI arXiv OpenURL
Mendoza-Granada, Fabricio; Villagra, Marcos A distributed algorithm for spectral sparsification of graphs with applications to data clustering. (English) Zbl 1483.68259 Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 403-413 (2021). MSC: 68R10 05C42 05C50 62H30 68Q11 68W15 PDF BibTeX XML Cite \textit{F. Mendoza-Granada} and \textit{M. Villagra}, AIRO Springer Ser. 5, 403--413 (2021; Zbl 1483.68259) Full Text: DOI arXiv OpenURL
Yin, Ying; Zhao, Yuhai; Li, He; Dong, Xiangjun Multi-objective evolutionary clustering for large-scale dynamic community detection. (English) Zbl 1474.62257 Inf. Sci. 549, 269-287 (2021). MSC: 62H30 68W50 90C29 90C59 PDF BibTeX XML Cite \textit{Y. Yin} et al., Inf. Sci. 549, 269--287 (2021; Zbl 1474.62257) Full Text: DOI OpenURL
Carlsson, Gunnar; Mémoli, Facundo; Segarra, Santiago Robust hierarchical clustering for directed networks: an axiomatic approach. (English) Zbl 07430673 SIAM J. Appl. Algebra Geom. 5, No. 4, 675-700 (2021). MSC: 68R10 68R12 62H30 91C20 PDF BibTeX XML Cite \textit{G. Carlsson} et al., SIAM J. Appl. Algebra Geom. 5, No. 4, 675--700 (2021; Zbl 07430673) Full Text: DOI arXiv OpenURL
Sadeghian, Azam; Shahzadeh Fazeli, Seyed Abolfazl; Karbassi, Seyed Mehdi Graph clustering by hierarchical singular value decomposition with selectable range for number of clusters members. (English) Zbl 07426501 Iran. J. Math. Sci. Inform. 16, No. 1, 105-121 (2021). MSC: 68W99 PDF BibTeX XML Cite \textit{A. Sadeghian} et al., Iran. J. Math. Sci. Inform. 16, No. 1, 105--121 (2021; Zbl 07426501) Full Text: Link OpenURL
Mizutani, Keisuke; Kawaguchi, Ken’ichi Curve approximation by \(G^1\) arc splines with a limited number of types of curvature and length. (English) Zbl 07424072 Comput. Aided Geom. Des. 90, Article ID 102036, 14 p. (2021). MSC: 65Dxx PDF BibTeX XML Cite \textit{K. Mizutani} and \textit{K. Kawaguchi}, Comput. Aided Geom. Des. 90, Article ID 102036, 14 p. (2021; Zbl 07424072) Full Text: DOI OpenURL
Wywiał, Janusz L.; Sitek, Grzegorz The influence of clustering population on estimation accuracy of population totals vector. (English) Zbl 1477.62165 J. Stat. Theory Pract. 15, No. 3, Paper No. 61, 16 p. (2021). MSC: 62H30 62M15 PDF BibTeX XML Cite \textit{J. L. Wywiał} and \textit{G. Sitek}, J. Stat. Theory Pract. 15, No. 3, Paper No. 61, 16 p. (2021; Zbl 1477.62165) Full Text: DOI OpenURL
Braverman, Vladimir; Lang, Harry; Levin, Keith; Rudoy, Yevgeniy Metric \(k\)-median clustering in insertion-only streams. (English) Zbl 07404867 Discrete Appl. Math. 304, 164-180 (2021). MSC: 68Wxx 68Qxx 68Txx PDF BibTeX XML Cite \textit{V. Braverman} et al., Discrete Appl. Math. 304, 164--180 (2021; Zbl 07404867) Full Text: DOI OpenURL
Kel’manov, A. V.; Pyatkin, A. V.; Khandeev, V. I. Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability. (English. Russian original) Zbl 07377486 Proc. Steklov Inst. Math. 313, Suppl. 1, S117-S124 (2021); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 25, No. 4, 69-78 (2019). MSC: 68W25 PDF BibTeX XML Cite \textit{A. V. Kel'manov} et al., Proc. Steklov Inst. Math. 313, S117--S124 (2021; Zbl 07377486); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 25, No. 4, 69--78 (2019) Full Text: DOI OpenURL
Gao, Chao; Ma, Zongming Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing. (English) Zbl 07368217 Stat. Sci. 36, No. 1, 16-33 (2021). MSC: 62-XX PDF BibTeX XML Cite \textit{C. Gao} and \textit{Z. Ma}, Stat. Sci. 36, No. 1, 16--33 (2021; Zbl 07368217) Full Text: DOI arXiv OpenURL
Ahn, Kook Jin; Cormode, Graham; Guha, Sudipto; McGregor, Andrew; Wirth, Anthony Correlation clustering in data streams. (English) Zbl 07365268 Algorithmica 83, No. 7, 1980-2017 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{K. J. Ahn} et al., Algorithmica 83, No. 7, 1980--2017 (2021; Zbl 07365268) Full Text: DOI arXiv OpenURL
Schoen, Fabio; Tigli, Luca Efficient large scale global optimization through clustering-based population methods. (English) Zbl 07350550 Comput. Oper. Res. 127, Article ID 105165, 15 p. (2021). MSC: 90Bxx PDF BibTeX XML Cite \textit{F. Schoen} and \textit{L. Tigli}, Comput. Oper. Res. 127, Article ID 105165, 15 p. (2021; Zbl 07350550) Full Text: DOI OpenURL
Hidalgo, Javier; Schafgans, Marcia Inference without smoothing for large panels with cross-sectional and temporal dependence. (English) Zbl 1471.62465 J. Econom. 223, No. 1, 125-160 (2021). MSC: 62M10 62G09 62P20 PDF BibTeX XML Cite \textit{J. Hidalgo} and \textit{M. Schafgans}, J. Econom. 223, No. 1, 125--160 (2021; Zbl 1471.62465) Full Text: DOI arXiv Link OpenURL
Bury, Marc; Gentili, Michele; Schwiegelshohn, Chris; Sorella, Mara Polynomial time approximation schemes for all 1-center problems on metric rational set similarities. (English) Zbl 07335026 Algorithmica 83, No. 5, 1371-1392 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{M. Bury} et al., Algorithmica 83, No. 5, 1371--1392 (2021; Zbl 07335026) Full Text: DOI OpenURL
Cicalese, Ferdinando; Laber, Eduardo Sany Information theoretical clustering is hard to approximate. (English) Zbl 1473.94024 IEEE Trans. Inf. Theory 67, No. 1, 586-597 (2021). MSC: 94A15 94A17 68Q17 68W25 PDF BibTeX XML Cite \textit{F. Cicalese} and \textit{E. S. Laber}, IEEE Trans. Inf. Theory 67, No. 1, 586--597 (2021; Zbl 1473.94024) Full Text: DOI arXiv OpenURL
Leiter, Noam; Zelazo, Daniel Edge-matching graph contractions and their interlacing properties. (English) Zbl 1459.05178 Linear Algebra Appl. 612, 289-317 (2021). MSC: 05C50 05C70 05A18 05C05 05C38 05C85 06A06 15A18 PDF BibTeX XML Cite \textit{N. Leiter} and \textit{D. Zelazo}, Linear Algebra Appl. 612, 289--317 (2021; Zbl 1459.05178) Full Text: DOI arXiv OpenURL
Luo, Junjie; Molter, Hendrik; Nichterlein, André; Niedermeier, Rolf Parameterized dynamic cluster editing. (English) Zbl 07303842 Algorithmica 83, No. 1, 1-44 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{J. Luo} et al., Algorithmica 83, No. 1, 1--44 (2021; Zbl 07303842) Full Text: DOI arXiv OpenURL
Gan, Junhao; Gleich, David F.; Veldt, Nate; Wirth, Anthony; Zhang, Xin Graph clustering in all parameter regimes. (English) Zbl 07559410 Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 39, 15 p. (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{J. Gan} et al., LIPIcs -- Leibniz Int. Proc. Inform. 170, Article 39, 15 p. (2020; Zbl 07559410) Full Text: DOI OpenURL
Il’ev, Viktor Petrovich; Il’eva, Svetlana Diadorovna; Morshinin, Aleksandr Vladimirovich 2-approximation algorithms for two graph clustering problems. (Russian. English summary) Zbl 07558122 Diskretn. Anal. Issled. Oper. 27, No. 3, 88-108 (2020). MSC: 68T05 68Q17 68R10 68W25 PDF BibTeX XML Cite \textit{V. P. Il'ev} et al., Diskretn. Anal. Issled. Oper. 27, No. 3, 88--108 (2020; Zbl 07558122) Full Text: DOI MNR OpenURL
Lai, Ming-Jun; Mckenzie, Daniel Compressive sensing for cut improvement and local clustering. (English) Zbl 07468915 SIAM J. Math. Data Sci. 2, No. 2, 368-395 (2020). MSC: 68Q25 68R10 68U05 94A12 PDF BibTeX XML Cite \textit{M.-J. Lai} and \textit{D. Mckenzie}, SIAM J. Math. Data Sci. 2, No. 2, 368--395 (2020; Zbl 07468915) Full Text: DOI arXiv OpenURL
Gao, Weifeng; Luo, Yuting; Xu, Jingwei; Zhu, Shengqi Evolutionary algorithm with multiobjective optimization technique for solving nonlinear equation systems. (English) Zbl 1475.65028 Inf. Sci. 541, 345-361 (2020). MSC: 65H10 68W50 90C29 90C59 PDF BibTeX XML Cite \textit{W. Gao} et al., Inf. Sci. 541, 345--361 (2020; Zbl 1475.65028) Full Text: DOI OpenURL
Liu, Songbai; Yu, Qiyuan; Lin, Qiuzhen; Tan, Kay Chen An adaptive clustering-based evolutionary algorithm for many-objective optimization problems. (English) Zbl 1474.90538 Inf. Sci. 537, 261-283 (2020). MSC: 90C59 68W50 90C29 PDF BibTeX XML Cite \textit{S. Liu} et al., Inf. Sci. 537, 261--283 (2020; Zbl 1474.90538) Full Text: DOI OpenURL
Lu, Hui; Liu, Yaxian; Cheng, Shi; Shi, Yuhui Adaptive online data-driven closed-loop parameter control strategy for swarm intelligence algorithm. (English) Zbl 1480.90253 Inf. Sci. 536, 25-52 (2020). MSC: 90C59 68W50 PDF BibTeX XML Cite \textit{H. Lu} et al., Inf. Sci. 536, 25--52 (2020; Zbl 1480.90253) Full Text: DOI OpenURL
Zhang, Xinming; Wang, Doudou; Fu, Zihao; Liu, Shangwang; Mao, Wentao; Liu, Guoqi; Jiang, Yun; Li, Shuangqian Novel biogeography-based optimization algorithm with hybrid migration and global-best Gaussian mutation. (English) Zbl 1481.90320 Appl. Math. Modelling 86, 74-91 (2020). MSC: 90C59 68W50 PDF BibTeX XML Cite \textit{X. Zhang} et al., Appl. Math. Modelling 86, 74--91 (2020; Zbl 1481.90320) Full Text: DOI OpenURL
Li, Hui; Zou, Peng; Huang, Zhigou; Zeng, Chenbo; Liu, Xiao Multimodal optimization using whale optimization algorithm enhanced with local search and niching technique. (English) Zbl 1473.90131 Math. Biosci. Eng. 17, No. 1, 1-27 (2020). MSC: 90C26 PDF BibTeX XML Cite \textit{H. Li} et al., Math. Biosci. Eng. 17, No. 1, 1--27 (2020; Zbl 1473.90131) Full Text: DOI OpenURL
Ji, Sai; Xu, Dachuan; Du, Donglei; Gai, Ling Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs. (English) Zbl 1482.68176 Zhang, Zhao (ed.) et al., Algorithmic aspects in information and management. 14th international conference, AAIM 2020, Jinhua, China, August 10–12, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12290, 97-107 (2020). MSC: 68R10 05C70 68W25 PDF BibTeX XML Cite \textit{S. Ji} et al., Lect. Notes Comput. Sci. 12290, 97--107 (2020; Zbl 1482.68176) Full Text: DOI OpenURL
Donovan, Z.; Subramani, K.; Mkrtchyan, V. Analyzing clustering and partitioning problems in selected VLSI models. (English) Zbl 07357722 Theory Comput. Syst. 64, No. 7, 1242-1272 (2020). MSC: 68Rxx 05Cxx 68Qxx 68Wxx PDF BibTeX XML Cite \textit{Z. Donovan} et al., Theory Comput. Syst. 64, No. 7, 1242--1272 (2020; Zbl 07357722) Full Text: DOI OpenURL
Rottenstreich, Ori; Kaplan, Haim; Hassidim, Avinatan Clustering in hypergraphs to minimize average edge service time. (English) Zbl 1484.68171 ACM Trans. Algorithms 16, No. 3, Article No. 40, 28 p. (2020). MSC: 68R10 05C65 05C70 68W40 PDF BibTeX XML Cite \textit{O. Rottenstreich} et al., ACM Trans. Algorithms 16, No. 3, Article No. 40, 28 p. (2020; Zbl 1484.68171) Full Text: DOI Link OpenURL
Balcan, Maria-Florina; Haghtalab, Nika; White, Colin \(k\)-center clustering under perturbation resilience. (English) Zbl 1484.68066 ACM Trans. Algorithms 16, No. 2, Article No. 22, 39 p. (2020). MSC: 68Q25 68Q17 68W25 PDF BibTeX XML Cite \textit{M.-F. Balcan} et al., ACM Trans. Algorithms 16, No. 2, Article No. 22, 39 p. (2020; Zbl 1484.68066) Full Text: DOI OpenURL
Bezerra, Clauber Gomes; Costa, Bruno Sielly Jales; Guedes, Luiz Affonso; Angelov, Plamen Parvanov An evolving approach to data streams clustering based on typicality and eccentricity data analytics. (English) Zbl 1457.68228 Inf. Sci. 518, 13-28 (2020). MSC: 68T05 62H30 62L12 68W27 PDF BibTeX XML Cite \textit{C. G. Bezerra} et al., Inf. Sci. 518, 13--28 (2020; Zbl 1457.68228) Full Text: DOI Link OpenURL
Lv, Shaoqing; Xiang, Ju; Feng, Jingyu; Wang, Honggang; Lu, Guangyue; Li, Min Community enhancement network embedding based on edge reweighting preprocessing. (English) Zbl 1459.68162 J. Stat. Mech. Theory Exp. 2020, No. 10, Article ID 103403, 18 p. (2020). MSC: 68R10 05C80 05C82 68T05 68W40 PDF BibTeX XML Cite \textit{S. Lv} et al., J. Stat. Mech. Theory Exp. 2020, No. 10, Article ID 103403, 18 p. (2020; Zbl 1459.68162) Full Text: DOI OpenURL
Fomin, Fedor V.; Golovach, Petr A.; Panolan, Fahad Parameterized low-rank binary matrix approximation. (English) Zbl 1458.68075 Data Min. Knowl. Discov. 34, No. 2, 478-532 (2020). MSC: 68Q27 15A60 15B34 62H30 68W25 PDF BibTeX XML Cite \textit{F. V. Fomin} et al., Data Min. Knowl. Discov. 34, No. 2, 478--532 (2020; Zbl 1458.68075) Full Text: DOI arXiv Link OpenURL
Avin, Chen; Bienkowski, Marcin; Loukas, Andreas; Pacut, Maciej; Schmid, Stefan Dynamic balanced graph partitioning. (English) Zbl 1465.68202 SIAM J. Discrete Math. 34, No. 3, 1791-1812 (2020). Reviewer: Gunther Schmidt (München) MSC: 68R10 68Q25 68W05 68W40 PDF BibTeX XML Cite \textit{C. Avin} et al., SIAM J. Discrete Math. 34, No. 3, 1791--1812 (2020; Zbl 1465.68202) Full Text: DOI arXiv OpenURL
Henzinger, Monika; Leniowski, Dariusz; Mathieu, Claire Dynamic clustering to minimize the sum of radii. (English) Zbl 1476.90178 Algorithmica 82, No. 11, 3183-3194 (2020). MSC: 90B80 68P05 68U05 68W25 PDF BibTeX XML Cite \textit{M. Henzinger} et al., Algorithmica 82, No. 11, 3183--3194 (2020; Zbl 1476.90178) Full Text: DOI Link OpenURL
Ding, Hu Faster balanced clusterings in high dimension. (English) Zbl 1455.68274 Theor. Comput. Sci. 842, 28-40 (2020). MSC: 68W25 62H30 68U05 68W40 PDF BibTeX XML Cite \textit{H. Ding}, Theor. Comput. Sci. 842, 28--40 (2020; Zbl 1455.68274) Full Text: DOI arXiv OpenURL
Little, Anna; Maggioni, Mauro; Murphy, James M. Path-based spectral clustering: guarantees, robustness to outliers, and fast algorithms. (English) Zbl 07255037 J. Mach. Learn. Res. 21, Paper No. 6, 66 p. (2020). MSC: 68T05 PDF BibTeX XML Cite \textit{A. Little} et al., J. Mach. Learn. Res. 21, Paper No. 6, 66 p. (2020; Zbl 07255037) Full Text: arXiv Link OpenURL
Cuong, Tran Hung; Yao, Jen-Chih; Yen, Nguyen Dong Qualitative properties of the minimum sum-of-squares clustering problem. (English) Zbl 1444.68155 Optimization 69, No. 9, 2131-2154 (2020). MSC: 68T05 68W40 90C26 90C90 PDF BibTeX XML Cite \textit{T. H. Cuong} et al., Optimization 69, No. 9, 2131--2154 (2020; Zbl 1444.68155) Full Text: DOI arXiv OpenURL
Ahmadian, Sara; Norouzi-Fard, Ashkan; Svensson, Ola; Ward, Justin Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms. (English) Zbl 1450.90005 SIAM J. Comput. 49, No. 4, FOCS17-97-FOCS17-156 (2020). MSC: 90C05 90C59 49M25 68W25 05C69 PDF BibTeX XML Cite \textit{S. Ahmadian} et al., SIAM J. Comput. 49, No. 4, FOCS17--97-FOCS17--156 (2020; Zbl 1450.90005) Full Text: DOI arXiv OpenURL
Nelles, Oliver Nonlinear system identification. From classical approaches to neural networks, fuzzy models, and Gaussian processes. 2nd edition. (English) Zbl 1453.93001 Cham: Springer (ISBN 978-3-030-47438-6/hbk; 978-3-030-47439-3/ebook). xxviii, 1225 p. (2020). MSC: 93-01 93-02 93B30 93C10 93C42 92B20 93C15 PDF BibTeX XML Cite \textit{O. Nelles}, Nonlinear system identification. From classical approaches to neural networks, fuzzy models, and Gaussian processes. 2nd edition. Cham: Springer (2020; Zbl 1453.93001) Full Text: DOI OpenURL
Feldman, Dan; Schmidt, Melanie; Sohler, Christian Turning big data into tiny data: constant-size coresets for \(k\)-means, PCA, and projective clustering. (English) Zbl 1451.68244 SIAM J. Comput. 49, No. 3, 601-657 (2020). MSC: 68T09 62H25 62H30 62R07 68W40 PDF BibTeX XML Cite \textit{D. Feldman} et al., SIAM J. Comput. 49, No. 3, 601--657 (2020; Zbl 1451.68244) Full Text: DOI arXiv OpenURL
Ikica, Barbara Clustering via the modified Petford-Welsh algorithm. (English) Zbl 1444.05137 Ars Math. Contemp. 18, No. 1, 33-49 (2020). MSC: 05C85 05C15 91C20 05C82 PDF BibTeX XML Cite \textit{B. Ikica}, Ars Math. Contemp. 18, No. 1, 33--49 (2020; Zbl 1444.05137) Full Text: DOI OpenURL
Favati, P.; Lotti, G.; Menchi, O.; Romani, F. Adaptive computation of the symmetric nonnegative matrix factorization (SymNMF). (English) Zbl 1455.65246 S\(\vec{\text{e}}\)MA J. 77, No. 2, 203-217 (2020). MSC: 65F55 65K05 65Y20 68Q25 PDF BibTeX XML Cite \textit{P. Favati} et al., S\(\vec{\text{e}}\)MA J. 77, No. 2, 203--217 (2020; Zbl 1455.65246) Full Text: DOI arXiv OpenURL
Raffo, Andrea; Barrowclough, Oliver J. D.; Muntingh, Georg Reverse engineering of CAD models via clustering and approximate implicitization. (English) Zbl 07207284 Comput. Aided Geom. Des. 80, Article ID 101876, 15 p. (2020). MSC: 65Dxx PDF BibTeX XML Cite \textit{A. Raffo} et al., Comput. Aided Geom. Des. 80, Article ID 101876, 15 p. (2020; Zbl 07207284) Full Text: DOI arXiv OpenURL
Ertem, Zeynep; Lykhovyd, Eugene; Wang, Yiming; Butenko, Sergiy The maximum independent union of cliques problem: complexity and exact approaches. (English) Zbl 1448.90093 J. Glob. Optim. 76, No. 3, 545-562 (2020). Reviewer: Patric R. J. Östergård (Aalto) MSC: 90C35 68Q25 90C10 90C57 PDF BibTeX XML Cite \textit{Z. Ertem} et al., J. Glob. Optim. 76, No. 3, 545--562 (2020; Zbl 1448.90093) Full Text: DOI OpenURL
Chrobak, Marek; Dürr, Christoph; Fabijan, Aleksander; Nilsson, Bengt J. Online clique clustering. (English) Zbl 1435.68386 Algorithmica 82, No. 4, 938-965 (2020). MSC: 68W27 05C69 05C70 05C85 90C35 PDF BibTeX XML Cite \textit{M. Chrobak} et al., Algorithmica 82, No. 4, 938--965 (2020; Zbl 1435.68386) Full Text: DOI arXiv OpenURL
Ding, Hu; Xu, Jinhui A unified framework for clustering constrained data without locality property. (English) Zbl 1435.68340 Algorithmica 82, No. 4, 808-852 (2020). MSC: 68U05 62H30 68W25 PDF BibTeX XML Cite \textit{H. Ding} and \textit{J. Xu}, Algorithmica 82, No. 4, 808--852 (2020; Zbl 1435.68340) Full Text: DOI arXiv OpenURL
Puccetti, Giovanni; Rüschendorf, Ludger; Vanduffel, Steven On the computation of Wasserstein barycenters. (English) Zbl 07163065 J. Multivariate Anal. 176, Article ID 104581, 16 p. (2020). MSC: 62-08 68U10 68W25 PDF BibTeX XML Cite \textit{G. Puccetti} et al., J. Multivariate Anal. 176, Article ID 104581, 16 p. (2020; Zbl 07163065) Full Text: DOI OpenURL
Abrahamsen, Mikkel; de Berg, Mark; Buchin, Kevin; Mehr, Mehran; Mehrabi, Ali D. Minimum perimeter-sum partitions in the plane. (English) Zbl 1432.68479 Discrete Comput. Geom. 63, No. 2, 483-505 (2020). MSC: 68U05 68W25 68W40 PDF BibTeX XML Cite \textit{M. Abrahamsen} et al., Discrete Comput. Geom. 63, No. 2, 483--505 (2020; Zbl 1432.68479) Full Text: DOI Link OpenURL
Dumitrescu, Adrian; Ghosh, Anirban; Tóth, Csaba D. Online unit covering in Euclidean space. (English) Zbl 1436.68380 Theor. Comput. Sci. 809, 218-230 (2020). MSC: 68U05 68W27 PDF BibTeX XML Cite \textit{A. Dumitrescu} et al., Theor. Comput. Sci. 809, 218--230 (2020; Zbl 1436.68380) Full Text: DOI arXiv OpenURL
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket Approximation schemes for low-rank binary matrix approximation problems. (English) Zbl 1454.68180 ACM Trans. Algorithms 16, No. 1, Article No. 12, 39 p. (2020). MSC: 68W25 15A23 15B33 68W20 68W40 PDF BibTeX XML Cite \textit{F. V. Fomin} et al., ACM Trans. Algorithms 16, No. 1, Article No. 12, 39 p. (2020; Zbl 1454.68180) Full Text: DOI arXiv OpenURL
Cohen-Addad, Vincent; Gupta, Anupam; Kumar, Amit; Lee, Euiwoong; Li, Jason Tight FPT approximations for \(k\)-median and \(k\)-means. (English) Zbl 07561535 Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 42, 14 p. (2019). MSC: 68Nxx 68Qxx PDF BibTeX XML Cite \textit{V. Cohen-Addad} et al., LIPIcs -- Leibniz Int. Proc. Inform. 132, Article 42, 14 p. (2019; Zbl 07561535) Full Text: DOI OpenURL
Cohen-Addad, Vincent; Li, Jason On the fixed-parameter tractability of capacitated clustering. (English) Zbl 07561534 Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 41, 14 p. (2019). MSC: 68Nxx 68Qxx PDF BibTeX XML Cite \textit{V. Cohen-Addad} and \textit{J. Li}, LIPIcs -- Leibniz Int. Proc. Inform. 132, Article 41, 14 p. (2019; Zbl 07561534) Full Text: DOI OpenURL
Inamdar, Tanmay; Pai, Shreyas; Pemmaraju, Sriram V. Large-scale distributed algorithms for facility location with outliers. (English) Zbl 07561433 Cao, Jiannong (ed.) et al., 22nd international conference on principles of distributed systems, OPODIS 2018, December 17–19, 2018, Hong Kong, China. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 125, Article 5, 16 p. (2019). MSC: 68M14 68M20 PDF BibTeX XML Cite \textit{T. Inamdar} et al., LIPIcs -- Leibniz Int. Proc. Inform. 125, Article 5, 16 p. (2019; Zbl 07561433) Full Text: DOI OpenURL
Saha, Barna; Subramanian, Sanjay Correlation clustering with same-cluster queries bounded by optimal cost. (English) Zbl 07525518 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 81, 17 p. (2019). MSC: 68Wxx PDF BibTeX XML Cite \textit{B. Saha} and \textit{S. Subramanian}, LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 81, 17 p. (2019; Zbl 07525518) Full Text: DOI OpenURL
Ding, Hu; Yu, Haikuo; Wang, Zixiu Greedy strategy works for \(k\)-center clustering with outliers and coreset construction. (English) Zbl 07525477 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 40, 16 p. (2019). MSC: 68Wxx PDF BibTeX XML Cite \textit{H. Ding} et al., LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 40, 16 p. (2019; Zbl 07525477) Full Text: DOI OpenURL
Chen, Jiehua; Hermelin, Danny; Sorge, Manuel On computing centroids according to the \(p\)-norms of Hamming distance vectors. (English) Zbl 07525465 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 28, 16 p. (2019). MSC: 68Wxx PDF BibTeX XML Cite \textit{J. Chen} et al., LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 28, 16 p. (2019; Zbl 07525465) Full Text: DOI OpenURL
Adamczyk, Marek; Byrka, Jaroslaw; Marcinkowski, Jan; Meesum, Syed M.; Włodarczyk, Michal Constant-factor FPT approximation for capacitated \(k\)-Median. (English) Zbl 07525438 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 1, 14 p. (2019). MSC: 68Wxx PDF BibTeX XML Cite \textit{M. Adamczyk} et al., LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 1, 14 p. (2019; Zbl 07525438) Full Text: DOI OpenURL
Veldt, Nate; Gleich, David F.; Wirth, Anthony; Saunderson, James Metric-constrained optimization for graph clustering algorithms. (English) Zbl 07468810 SIAM J. Math. Data Sci. 1, No. 2, 333-355 (2019). MSC: 05C85 65K05 68W25 90C35 90C05 PDF BibTeX XML Cite \textit{N. Veldt} et al., SIAM J. Math. Data Sci. 1, No. 2, 333--355 (2019; Zbl 07468810) Full Text: DOI OpenURL
Casel, Katrin Resolving conflicts for lower-bounded clustering. (English) Zbl 07378609 Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 23, 14 p. (2019). MSC: 68Q25 68Wxx PDF BibTeX XML Cite \textit{K. Casel}, LIPIcs -- Leibniz Int. Proc. Inform. 115, Article 23, 14 p. (2019; Zbl 07378609) Full Text: DOI OpenURL
Van Lierde, Hadrien; Chow, Tommy W. S.; Delvenne, Jean-Charles Spectral clustering algorithms for the detection of clusters in block-cyclic and block-acyclic graphs. (English) Zbl 1462.05333 J. Complex Netw. 7, No. 1, 1-53 (2019). MSC: 05C82 05C38 05C20 05C85 05C81 PDF BibTeX XML Cite \textit{H. Van Lierde} et al., J. Complex Netw. 7, No. 1, 1--53 (2019; Zbl 1462.05333) Full Text: DOI arXiv OpenURL
Rybalov, A. N. On generic complexity of the graph clustering problem. (Russian. English summary) Zbl 1458.68073 Prikl. Diskretn. Mat. 2019, No. 46, 72-77 (2019). MSC: 68Q25 68R10 PDF BibTeX XML Cite \textit{A. N. Rybalov}, Prikl. Diskretn. Mat. 2019, No. 46, 72--77 (2019; Zbl 1458.68073) Full Text: DOI MNR OpenURL
Il’ev, V. P.; Il’eva, S. D.; Morshinin, A. V. Approximate algorithms for graph clustering problem. (Russian. English summary) Zbl 1458.68281 Prikl. Diskretn. Mat. 2019, No. 45, 64-77 (2019). MSC: 68W25 68R10 PDF BibTeX XML Cite \textit{V. P. Il'ev} et al., Prikl. Diskretn. Mat. 2019, No. 45, 64--77 (2019; Zbl 1458.68281) Full Text: DOI MNR OpenURL
Avin, Chen; Cohen, Louis; Parham, Mahmoud; Schmid, Stefan Competitive clustering of stochastic communication patterns on a ring. (English) Zbl 1459.68008 Computing 101, No. 9, 1369-1390 (2019). MSC: 68M10 68M20 68W20 68W27 PDF BibTeX XML Cite \textit{C. Avin} et al., Computing 101, No. 9, 1369--1390 (2019; Zbl 1459.68008) Full Text: DOI OpenURL
Jin, Yongxian; Zhu, Hong Multipath routing protocol for wireless sensor networks based on clustering and ant colony. (Chinese. English summary) Zbl 1449.68013 J. Zhejiang Norm. Univ., Nat. Sci. 42, No. 4, 400-406 (2019). MSC: 68M18 68M12 68W50 PDF BibTeX XML Cite \textit{Y. Jin} and \textit{H. Zhu}, J. Zhejiang Norm. Univ., Nat. Sci. 42, No. 4, 400--406 (2019; Zbl 1449.68013) Full Text: DOI OpenURL
Malyk, I. V.; Knignits’ka, T. V.; Gorbatenko, M. Yu. Clustering: Markov algorithm. (Ukrainian. English summary) Zbl 1449.60006 Bukovyn. Mat. Zh. 7, No. 2, 59-75 (2019). MSC: 60B20 60J10 65C05 68W99 PDF BibTeX XML Cite \textit{I. V. Malyk} et al., Bukovyn. Mat. Zh. 7, No. 2, 59--75 (2019; Zbl 1449.60006) Full Text: Link OpenURL
Bertozzi, Andrea L.; Merkurjev, Ekaterina Graph-based optimization approaches for machine learning, uncertainty quantification and networks. (English) Zbl 1446.65032 Kimmel, Ron (ed.) et al., Processing, analyzing and learning of images, shapes, and forms. Part 2. Amsterdam: Elsevier/North Holland. Handb. Numer. Anal. 20, 503-531 (2019). MSC: 65K10 05C85 62H30 68U10 35R02 91D30 49M29 94C15 PDF BibTeX XML Cite \textit{A. L. Bertozzi} and \textit{E. Merkurjev}, Handb. Numer. Anal. 20, 503--531 (2019; Zbl 1446.65032) Full Text: DOI OpenURL
Cohen-Addad, Vincent; Kanade, Varun; Mallmann-trenn, Frederik; Mathieu, Claire Hierarchical clustering. Objective functions and algorithms. (English) Zbl 1473.62213 J. ACM 66, No. 4, Article No. 26, 42 p. (2019). MSC: 62H30 68W40 90C27 PDF BibTeX XML Cite \textit{V. Cohen-Addad} et al., J. ACM 66, No. 4, Article No. 26, 42 p. (2019; Zbl 1473.62213) Full Text: DOI OpenURL
Harris, David G.; Li, Shi; Pensyl, Thomas; Srinivasan, Aravind; Trinh, Khoa Approximation algorithms for stochastic clustering. (English) Zbl 1442.68265 J. Mach. Learn. Res. 20, Paper No. 153, 33 p. (2019). MSC: 68W25 62H30 PDF BibTeX XML Cite \textit{D. G. Harris} et al., J. Mach. Learn. Res. 20, Paper No. 153, 33 p. (2019; Zbl 1442.68265) Full Text: arXiv Link OpenURL
Ahmadi, Saba; Khuller, Samir; Saha, Barna Min-max correlation clustering via multicut. (English) Zbl 1436.90114 Lodi, Andrea (ed.) et al., Integer programming and combinatorial optimization. 20th international conference, IPCO 2019, Ann Arbor, MI, USA, May 22–24, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11480, 13-26 (2019). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{S. Ahmadi} et al., Lect. Notes Comput. Sci. 11480, 13--26 (2019; Zbl 1436.90114) Full Text: DOI arXiv OpenURL
Makarychev, Konstantin; Makarychev, Yury; Razenshteyn, Ilya Performance of Johnson-Lindenstrauss transform for \(k\)-means and \(k\)-medians clustering. (English) Zbl 1433.68366 Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 1027-1038 (2019). MSC: 68T05 62H30 68R12 PDF BibTeX XML Cite \textit{K. Makarychev} et al., in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 1027--1038 (2019; Zbl 1433.68366) Full Text: DOI arXiv OpenURL
Chakrabarty, Deeparnab; Swamy, Chaitanya Approximation algorithms for minimum norm and ordered optimization problems. (English) Zbl 1433.68612 Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 126-137 (2019). MSC: 68W25 90B35 90B80 90C27 PDF BibTeX XML Cite \textit{D. Chakrabarty} and \textit{C. Swamy}, in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 126--137 (2019; Zbl 1433.68612) Full Text: DOI arXiv OpenURL
Aronov, Boris; Filtser, Omrit; Horton, Michael; Katz, Matthew J.; Sheikhan, Khadijeh Efficient nearest-neighbor query and clustering of planar curves. (English) Zbl 07152198 Friggstad, Zachary (ed.) et al., Algorithms and data structures. 16th international symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11646, 28-42 (2019). MSC: 68P05 68Wxx PDF BibTeX XML Cite \textit{B. Aronov} et al., Lect. Notes Comput. Sci. 11646, 28--42 (2019; Zbl 07152198) Full Text: DOI arXiv OpenURL
Kel’manov, A. V.; Khandeev, V. I. Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem. (English. Russian original) Zbl 07150939 Comput. Math. Math. Phys. 59, No. 9, 1553-1561 (2019); translation from Zh. Vychisl. Mat. Mat. Fiz. 59, No. 9, 1617-1625 (2019). MSC: 68Q25 90C20 PDF BibTeX XML Cite \textit{A. V. Kel'manov} and \textit{V. I. Khandeev}, Comput. Math. Math. Phys. 59, No. 9, 1553--1561 (2019; Zbl 07150939); translation from Zh. Vychisl. Mat. Mat. Fiz. 59, No. 9, 1617--1625 (2019) Full Text: DOI OpenURL
Wang, Qi; Wang, Yinhe; Gao, Zilin; Zhang, Lili; Wang, Wenli The necessary and sufficient condition for clustering of nodes based on the signs of connections in generalized signed networks. (English) Zbl 1427.05222 Int. J. Mod. Phys. B 33, No. 10, Article ID 1950086, 16 p. (2019). MSC: 05C85 05C22 PDF BibTeX XML Cite \textit{Q. Wang} et al., Int. J. Mod. Phys. B 33, No. 10, Article ID 1950086, 16 p. (2019; Zbl 1427.05222) Full Text: DOI OpenURL
Chakrabarty, Deeparnab; Negahbani, Maryam Generalized center problems with outliers. (English) Zbl 1454.68177 ACM Trans. Algorithms 15, No. 3, Article No. 41, 14 p. (2019). MSC: 68W25 90C27 90C59 PDF BibTeX XML Cite \textit{D. Chakrabarty} and \textit{M. Negahbani}, ACM Trans. Algorithms 15, No. 3, Article No. 41, 14 p. (2019; Zbl 1454.68177) Full Text: DOI arXiv Link OpenURL