An approximation algorithm for a problem of cluster analysis
From MaRDI portal
Publication:3115255
zbMATH Open1249.90186MaRDI QIDQ3115255FDOQ3115255
Authors: A. V. Dolgushev, A. V. Kel'manov 
Publication date: 20 February 2012
Recommendations
- A 2-approximation polynomial algorithm for a clustering problem
- An approximation algorithm for solving the problem of the search of a subset of vectors
- An approximating polynomial algorithm for a sequence partitioning problem
- Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center
- Clustering to minimize the maximum intercluster distance
Cited In (31)
- An approximation algorithm for solving the problem of the search of a subset of vectors
- On the complexity of some cluster analysis problems
- A randomized algorithm for two-cluster partition of a set of vectors
- Randomized Algorithm of Finding the True Number of Clusters Based on Chebychev Polynomial Approximation
- An Exchange Algorithm for Two-Mode Cluster Analysis
- An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes
- Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center
- Title not available (Why is that?)
- An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
- A 2-approximation polynomial algorithm for a clustering problem
- Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear-time approximation schemes for clustering problems in any dimensions
- Approximation algorithms for the metric maximum clustering problem with given cluster sizes.
- A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum
- Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem
- Evaluation of a Branch and Bound Algorithm for Clustering
- Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability
- Exact and approximation algorithms for clustering
- A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem
- An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors
- Clustering via the modified Petford-Welsh algorithm
- Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters
- Exact pseudo-polynomial algorithms for a balanced 2-clustering problem
- A New Composite Algorithm for Clustering Problems
- Solving some vector subset problems by Voronoi diagrams
- Heuristic methods for large centroid clustering problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation algorithms for projective clustering
This page was built for publication: An approximation algorithm for a problem of cluster analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115255)
