Approximation schemes for clustering problems
From MaRDI portal
Recommendations
Cited in
(70)- Heuristic methods for large centroid clustering problems
- On approximate geometric \(k\)-clustering
- Exact and approximation algorithms for clustering
- A PTAS for the k-consensus structures problem under squared Euclidean distance
- Faster algorithms for the constrained k-means problem
- Approximation algorithms for the metric maximum clustering problem with given cluster sizes.
- A refined approximation for Euclidean \(k\)-means
- Preclustering algorithms for imprecise points
- Parameterized \(k\)-clustering: tractability island
- A unified framework for clustering constrained data without locality property
- A framework for statistical clustering with constant time approximation algorithms for \(K\)-median and \(K\)-means clustering
- Improved PTAS for the constrained \(k\)-means problem
- Frequency-based views to pattern collections
- scientific article; zbMATH DE number 1629976 (Why is no real title available?)
- A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)
- Interactive clustering of linear classes and cryptographic lower bounds
- Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane
- Randomized Algorithm of Finding the True Number of Clusters Based on Chebychev Polynomial Approximation
- Clustering methods for printed circuit board insertion problems
- scientific article; zbMATH DE number 6351476 (Why is no real title available?)
- Clustering for edge-cost minimization (extended abstract)
- Polynomial-time approximation schemes for geometric min-sum median clustering
- Sublinear‐time approximation algorithms for clustering via random sampling
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median
- Clustering through continuous facility location problems
- A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance
- A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem
- Linear-time approximation schemes for clustering problems in any dimensions
- The Planar k-Means Problem is NP-Hard
- scientific article; zbMATH DE number 4036950 (Why is no real title available?)
- A randomized PTAS for the minimum consensus clustering with a fixed number of clusters
- scientific article; zbMATH DE number 1303609 (Why is no real title available?)
- scientific article; zbMATH DE number 1124647 (Why is no real title available?)
- The planar \(k\)-means problem is NP-hard
- Testing of Clustering
- scientific article; zbMATH DE number 6902592 (Why is no real title available?)
- Range-clustering queries
- Approximation schemes for clustering with outliers
- Approximate clustering without the approximation
- Local search yields a PTAS for \(k\)-means in doubling metrics
- Approximate clustering via metric partitioning
- Data stability in clustering: a closer look
- Approximation algorithms for projective clustering
- A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
- scientific article; zbMATH DE number 907937 (Why is no real title available?)
- Approximation schemes for clustering with outliers
- Approximate Clustering with Same-Cluster Queries
- Near-linear Time Approximation Schemes for Clustering in Doubling Metrics
- Efficient approximation schemes for uniform-cost clustering problems in planar graphs
- On the fixed-parameter tractability of capacitated clustering
- Approximation Schemes for Capacitated Clustering in Doubling Metrics
- scientific article; zbMATH DE number 7164768 (Why is no real title available?)
- scientific article; zbMATH DE number 6297742 (Why is no real title available?)
- Selective sampling for approximate clustering of very large data sets
- Approximation schemes for metric bisection and partitioning
- SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search
- Clustering mixtures with almost optimal separation in polynomial time
- Clustering what matters: optimal approximation for clustering with outliers
- Parameterized approximation algorithms and lower bounds for k-center clustering and variants
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median
- Approximation schemes for Min-Sum \(k\)-Clustering
- Polynomial-time approximation schemes for facility location on planar graphs
- Approximation algorithms for continuous clustering and facility location problems
- Faster approximation schemes for (constrained) k-means with outliers
- On approximability of _2² min-sum clustering
- Efficient approximation algorithms for clustering point-sets
- Center-based clustering under perturbation stability
- An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes
- Small space representations for metric min-sum k-clustering and their applications
- Min sum clustering with penalties
This page was built for publication: Approximation schemes for clustering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581243)
