A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets
From MaRDI portal
(Redirected from Publication:463361)
Recommendations
- An approximation algorithm for solving the problem of the search of a subset of vectors
- Pseudopolynomial time solvability of a quadratic Euclidean problem of finding a family of disjoint subsets
- Max-Min Problems of Searching for Two Disjoint Subsets
- An FPTAS for a vector subset search problem
- A 2-approximation polynomial algorithm for a clustering problem
Cites work
- An approximation scheme for a problem of search for a vector subset
- Cluster Analysis and Mathematical Programming
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- NP-hardness of Euclidean sum-of-squares clustering
- Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems
- The Planar k-Means Problem is NP-Hard
Cited in
(9)- A randomized algorithm for two-cluster partition of a set of vectors
- On the complexity of some quadratic Euclidean 2-clustering problems
- An approximation algorithm for solving the problem of the search of a subset of vectors
- An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors
- scientific article; zbMATH DE number 4106132 (Why is no real title available?)
- Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph
- An FPTAS for a vector subset search problem
- Pseudopolynomial time solvability of a quadratic Euclidean problem of finding a family of disjoint subsets
- PTAS for problems of vector choice and clustering with different centers
This page was built for publication: A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463361)
