Zobrazeno 1 - 7
of 7
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::748ca797d8a72e0b464b2089651a5f89
https://doi.org/10.1007/s00453-018-0454-1
https://doi.org/10.1007/s00453-018-0454-1
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
Autor:
Friggstad, Zachary, Golestanian, Arnoosh, Khodamoradi, Kamyar, Martin, Christopher, Rahgoshay, Mirmahdi, Rezapour, Mohsen, Salavatipour, Mohammad R., Zhang, Yifeng
Publikováno v:
Journal of Scheduling; Apr2019, Vol. 22 Issue 2, p239-253, 15p
Publikováno v:
Algorithmica; Mar2019, Vol. 81 Issue 3, p1006-1030, 25p
Publikováno v:
Automata, Languages & Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II; 2015, pI-XXXIX, 39p
Publikováno v:
Automata, Languages & Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I; 2015, p116-128, 13p
The two-volume set LNCS 9134 and LNCS 9135 constitutes the refereed proceedings of the 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, held in Kyoto, Japan, in July 2015. The 143 revised full papers presented were ca