Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Jamshidian, Mahya"'
Autor:
Friggstad, Zachary, Jamshidian, Mahya
In this paper, we present an improved approximation algorithm for three related problems. In the Minimum Sum of Radii clustering problem (MSR), we aim to select $k$ balls in a metric space to cover all points while minimizing the sum of the radii. In
Externí odkaz:
http://arxiv.org/abs/2412.16327
Autor:
Jamshidian, Mahya
In this study, we present an improved approximation algorithm for three related problems. In the Minimum Sum of Radii clustering problem (MSR), we aim to select k balls in a metric space to cover all points while minimizing the sum of the radii. In t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d04d3f1bb7fe1d571e2f2149ad263d2
Autor:
Friggstad, Zachary, Jamshidian, Mahya
We give an improved approximation algorithm for two related clustering problems. In the Minimum Sum of Radii clustering problem (MSR), we are to select k balls in a metric space to cover all points while minimizing the sum of the radii of these balls
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e7007763bec7118e23ea71ed9e2a3c2e