On the complexity of some problems of searching for a family of disjoint clusters
From MaRDI portal
Publication:2424385
DOI10.1134/S1064562419010162zbMath1489.68363OpenAlexW2946685700MaRDI QIDQ2424385
Artem V. Pyatkin, Vladimir Khandeev, Alexander Kel'Manov
Publication date: 24 June 2019
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064562419010162
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A streaming algorithm for 2-center with outliers in high dimensions
- Clustering large graphs via the singular value decomposition
- NP-hardness of Euclidean sum-of-squares clustering
- The simple plant location problem: Survey and synthesis
- An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
- Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
- A Best Possible Heuristic for the k-Center Problem
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
This page was built for publication: On the complexity of some problems of searching for a family of disjoint clusters
