Pages that link to "Item:Q3581243"

The following pages link to Approximation schemes for clustering problems (Q3581243):

Displaying 48 items.

• Clustering through continuous facility location problems (Q346248) (← links)
• A randomized PTAS for the minimum consensus clustering with a fixed number of clusters (Q418755) (← links)
• The planar \(k\)-means problem is NP-hard (Q441888) (← links)
• Data stability in clustering: a closer look (Q465252) (← links)
• A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems (Q486976) (← links)
• Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median (Q666661) (← links)
• Center-based clustering under perturbation stability (Q763489) (← links)
• An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes (Q844164) (← links)
• Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
• Min sum clustering with penalties (Q976485) (← links)
• Heuristic methods for large centroid clustering problems (Q1402504) (← links)
• Exact and approximation algorithms for clustering (Q1601015) (← links)
• Faster algorithms for the constrained \(k\)-means problem (Q1702850) (← links)
• Approximation algorithms for the metric maximum clustering problem with given cluster sizes. (Q1811624) (← links)
• A refined approximation for Euclidean \(k\)-means (Q2122798) (← links)
• Preclustering algorithms for imprecise points (Q2144264) (← links)
• Parameterized \(k\)-clustering: tractability island (Q2221803) (← links)
• A unified framework for clustering constrained data without locality property (Q2300724) (← links)
• A framework for statistical clustering with constant time approximation algorithms for \(K\)-median and \(K\)-means clustering (Q2384132) (← links)
• Improved PTAS for the constrained \(k\)-means problem (Q2424715) (← links)
• Frequency-based views to pattern collections (Q2489656) (← links)
• Interactive Clustering of Linear Classes and Cryptographic Lower Bounds (Q2835625) (← links)
• Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane (Q2988724) (← links)
• Clustering methods for printed circuit board insertion problems (Q3156664) (← links)
• (Q3191565) (← links)
• Sublinear‐time approximation algorithms for clustering via random sampling (Q3419620) (← links)
• Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median (Q3448778) (← links)
• Linear-time approximation schemes for clustering problems in any dimensions (Q3578186) (← links)
• The Planar k-Means Problem is NP-Hard (Q3605504) (← links)
• (Q3776414) (← links)
• (Q4250235) (← links)
• (Q4378677) (← links)
• (Q4576266) (← links)
• Local Search Yields a PTAS for $k$-Means in Doubling Metrics (Q4634026) (← links)
• Approximation algorithms for projective clustering (Q4808316) (← links)
• (Q4886779) (← links)
• Approximate Clustering with Same-Cluster Queries (Q4993306) (← links)
• (Q5075771) (← links)
• (Q5091191) (← links)
• Approximation Schemes for Capacitated Clustering in Doubling Metrics (Q5146927) (← links)
• (Q5214265) (← links)
• (Q5417662) (← links)
• Selective sampling for approximate clustering of very large data sets (Q5450361) (← links)
• SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search (Q5746249) (← links)
• Clustering mixtures with almost optimal separation in polynomial time (Q6083577) (← links)
• Clustering what matters: optimal approximation for clustering with outliers (Q6488820) (← links)
• Parameterized approximation algorithms and lower bounds for \(k\)-center clustering and variants (Q6586660) (← links)
• Approximation schemes for Min-Sum \(k\)-Clustering (Q6670503) (← links)