Fast approximation algorithms for some maximin clustering problems
In this paper, we consider three cases of an intractable problem of searching for two subsets in a finite set of points of Euclidean space. In all three cases, it is required to maximize the minimum cluster’s cardinality under constraint on each cluster’s scatter. The scatter is the sum of the dista...
Na minha lista:
| Principais autores: | , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
University of Belgrade
2024-01-01
|
| Serier: | Yugoslav Journal of Operations Research |
| Fag: | |
| Online adgang: | https://doiserbia.nb.rs/img/doi/0354-0243/2024/0354-02432300031K.pdf |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|