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...
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
University of Belgrade
2024-01-01
|
| シリーズ: | Yugoslav Journal of Operations Research |
| 主題: | |
| オンライン･アクセス: | https://doiserbia.nb.rs/img/doi/0354-0243/2024/0354-02432300031K.pdf |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|