NC algorithms for minimum sum of diameters clustering

• Main Authors: Juneam N., Kantabutra S.
• 格式: 雜誌
• 出版: 2017
• 在線閱讀: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85028464135&origin=inward; http://cmuir.cmu.ac.th/jspui/handle/6653943832/40906

Given a set of n entities to be classified, and a matric of dissimilarities between pairs of them. This article considers the problem called Minimum Sum of Diameters Clustering Problem, where a partition of the set of entities into κ clusters such that the sum of the diameters of these clusters is m...