On the parallel complexity of minimum sum of diameters clustering

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

Full description

Bibliographic Details

Published in:	2015 International Computer Science and Engineering Conference (ICSEC) pp. 1 - 6
Main Authors:	Juneam, Nopadon, Kantabutra, Sanpawat
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.11.2015
Subjects:	application in social networking clustering Clustering algorithms Complexity theory Computational modeling minimum sum of diameters Parallel algorithms parallel complexity Phase change random access memory PRAM algorithm Program processors Social network services
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!