Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Rohit Sivakumar"'
Publikováno v:
Algorithmica. 81:1006-1030
We consider two closely related fundamental clustering problems in this paper. In Min-Sumk-Clustering, one is given n points in a metric space and has to partition them into k clusters while minimizing the sum of pairwise distances between points in
Publikováno v:
Automata, Languages, and Programming ISBN: 9783662476710
ICALP (1)
ICALP (1)
We consider two closely related fundamental clustering problems in this paper. In the Min-Sum k -Clustering problem, one is given a metric space and has to partition the points into k clusters while minimizing the total pairwise distances between the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::beae4dd6d5a3faf5b61f3bdc2c748cb0
https://doi.org/10.1007/978-3-662-47672-7_10
https://doi.org/10.1007/978-3-662-47672-7_10