Constant-factor approximation algorithms for some maximin multi-clustering problems (Q6134049): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Outlier Analysis / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: NP-hardness of Euclidean sum-of-squares clustering / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2768359 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Clustering to minimize the maximum intercluster distance / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of some quadratic Euclidean partition problems into balanced clusters / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for geometric median problems / rank | |||
Normal rank | |||
Latest revision as of 17:18, 2 August 2024
scientific article; zbMATH DE number 7730544
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constant-factor approximation algorithms for some maximin multi-clustering problems |
scientific article; zbMATH DE number 7730544 |
Statements
Constant-factor approximation algorithms for some maximin multi-clustering problems (English)
0 references
21 August 2023
0 references
Euclidean space
0 references
clustering
0 references
max-min problem
0 references
NP-hardness
0 references
bounded scatter
0 references
approximation algorithm
0 references
0 references
0 references
