PTAS for p-means q-medoids r-given clustering problem
From MaRDI portal
Publication:6134053
DOI10.1007/978-3-031-35305-5_9zbMATH Open1528.90228OpenAlexW4381956304MaRDI QIDQ6134053FDOQ6134053
Authors: Artem Pyatkin 
Publication date: 21 August 2023
Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-35305-5_9
Recommendations
- Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability
- NP-hardness of quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the cluster sizes
- Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters
- The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension
- On the complexity of some quadratic Euclidean 2-clustering problems
Cites Work
- NP-hardness of Euclidean sum-of-squares clustering
- On Grouping for Maximum Homogeneity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Faster Scaling Algorithms for Network Problems
- A 2-approximation polynomial algorithm for a clustering problem
- A posteriori detection of a quasiperiodic fragment with a given number of repetitions in a numerical sequence
- The problem of finding a subset of vectors with maximal total weight
- On the complexity of a search for a subset of ``similar vectors
- An approximation scheme for a problem of search for a vector subset
- Grouping Multidimensional Data
- NP-hardness of quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the cluster sizes
Cited In (1)
This page was built for publication: PTAS for \(p\)-means \(q\)-medoids \(r\)-given clustering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134053)
