Titlebook: Algorithmic Aspects in Information and Management; 13th International C Ding-Zhu Du,Lian Li,Jialin Zhang Conference proceedings 2019 Spring

兩棲動(dòng)物

豪華

https://doi.org/10.1007/978-1-4757-0106-7a collection of given data with unit length into . sets so as to minimize the within-cluster sum of cosine dissimilarity. In this paper, we introduce the spherical .-means clustering with penalties and give a .-approximate algorithm, where . is the ratio of the maximal and the minimal penalty values of the given data set.

Matrimony

eulogize

Constant-Factor Greedy Algorithms for the Asymmetric ,-Center Problem in Parameterized Complete Digand .-CD from the angle of the parameterized upper bound on the ratio of two asymmetric edge-weights between two different vertices and on the ratio of two vertex-weights, respectively. Using the greedy method, we design a .-approximation algorithm for the A.CP in .-CD’s and a .-approximation algorithm for the WA.CP in .-CD’s, respectively.