Pages that link to "Item:Q3578186"
From MaRDI portal
The following pages link to Linear-time approximation schemes for clustering problems in any dimensions (Q3578186):
Displayed 46 items.
- A lower bound for metric 1-median selection (Q340556) (← links)
- Clustering through continuous facility location problems (Q346248) (← links)
- Some results on approximate 1-median selection in metric spaces (Q418725) (← links)
- Data stability in clustering: a closer look (Q465252) (← links)
- Improved analysis of \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems (Q477594) (← links)
- A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection (Q497691) (← links)
- An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions (Q1694399) (← links)
- Faster algorithms for the constrained \(k\)-means problem (Q1702850) (← links)
- On Las Vegas approximations for metric 1-median selection (Q1739219) (← links)
- Faster balanced clusterings in high dimension (Q2006774) (← links)
- Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1] (Q2010139) (← links)
- Lossy kernelization of same-size clustering (Q2097218) (← links)
- Approximation and complexity of the capacitated geometric median problem (Q2117109) (← links)
- Linear-size universal discretization of geometric center-based problems in fixed dimensions (Q2125228) (← links)
- On ultrametric 1-median selection (Q2182656) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- Parameterized \(k\)-clustering: tractability island (Q2221803) (← links)
- A unified framework for clustering constrained data without locality property (Q2300724) (← links)
- Learning the truth vector in high dimensions (Q2301361) (← links)
- Probabilistic \(k\)-median clustering in data streams (Q2344214) (← links)
- Improved PTAS for the constrained \(k\)-means problem (Q2424715) (← links)
- Better guarantees for \(k\)-median with service installation costs (Q2672628) (← links)
- Deterministic metric 1-median selection with A \(1-o(1)\) fraction of points ignored (Q2695287) (← links)
- Metric 1-Median Selection: Query Complexity vs. Approximation Ratio (Q2817856) (← links)
- Interactive Clustering of Linear Classes and Cryptographic Lower Bounds (Q2835625) (← links)
- Clustering with Internal Connectedness (Q3078394) (← links)
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
- (Q4633019) (← links)
- Local Search Yields a PTAS for $k$-Means in Doubling Metrics (Q4634026) (← links)
- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics (Q4634032) (← links)
- Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions (Q4965103) (← links)
- Approximate Clustering with Same-Cluster Queries (Q4993306) (← links)
- Parameterized Low-Rank Binary Matrix Approximation (Q5002728) (← links)
- (Q5075771) (← links)
- Probabilistic smallest enclosing ball in high dimensions via subgradient sampling (Q5088979) (← links)
- (Q5091191) (← links)
- (Q5091192) (← links)
- (Q5214265) (← links)
- (Q5743480) (← links)
- A unified framework of FPT approximation algorithms for clustering problems (Q6065394) (← links)
- Universal Algorithms for Clustering Problems (Q6075750) (← links)
- FPT Approximation for Constrained Metric k-Median/Means (Q6089659) (← links)
- Linear-time approximation scheme for \(k\)-means clustering of axis-parallel affine subspaces (Q6103169) (← links)
- How to find a good explanation for clustering? (Q6136087) (← links)
- Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space (Q6161667) (← links)
- Lossy kernelization of same-size clustering (Q6174654) (← links)