Pages that link to "Item:Q1009338"
From MaRDI portal
The following pages link to NP-hardness of Euclidean sum-of-squares clustering (Q1009338):
Displaying 50 items.
- An exact algorithm for stable instances of the \(k\)-means problem with penalties in fixed-dimensional Euclidean space (Q2165794) (← links)
- Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering (Q2189394) (← links)
- NP-hardness of quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the cluster sizes (Q2191318) (← links)
- Global optimality in \(k\)-means clustering (Q2195470) (← links)
- Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters (Q2206419) (← links)
- \(k\)-means genetic algorithms with greedy genetic operators (Q2217036) (← links)
- A constant FPT approximation algorithm for hard-capacitated \(k\)-means (Q2218871) (← links)
- Approximation algorithms for spherical \(k\)-means problem using local search scheme (Q2220852) (← links)
- Parameterized \(k\)-clustering: tractability island (Q2221803) (← links)
- Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems (Q2261720) (← links)
- On polynomial solvability of one quadratic Euclidean clustering problem on a line (Q2279767) (← links)
- Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem (Q2284268) (← links)
- When do birds of a feather flock together? \(k\)-means, proximity, and conic programming (Q2288194) (← links)
- The seeding algorithm for \(k\)-means problem with penalties (Q2292125) (← links)
- NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters (Q2304346) (← links)
- Fast and efficient nested simulation for large variable annuity portfolios: a surrogate modeling approach (Q2306093) (← links)
- The seeding algorithms for spherical \(k\)-means clustering (Q2307745) (← links)
- A fast k-prototypes algorithm using partial distance computation (Q2333494) (← links)
- Consistency of spectral clustering in stochastic block models (Q2338925) (← links)
- A randomized algorithm for two-cluster partition of a set of vectors (Q2354448) (← links)
- Variable neighborhood search for minimum sum-of-squares clustering on networks (Q2355953) (← links)
- Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters (Q2396371) (← links)
- Flow-based dissimilarity measures for reservoir models: a spatial-temporal tensor approach (Q2398874) (← links)
- On strategies to fix degenerate \(k\)-means solutions (Q2403298) (← links)
- Structural conditions for projection-cost preservation via randomized matrix multiplication (Q2419040) (← links)
- Local search approximation algorithms for the \(k\)-means problem with penalties (Q2420650) (← links)
- On the complexity of some problems of searching for a family of disjoint clusters (Q2424385) (← links)
- Improved PTAS for the constrained \(k\)-means problem (Q2424715) (← links)
- Optimising sum-of-squares measures for clustering multisets defined over a metric space (Q2444542) (← links)
- Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem (Q2630015) (← links)
- On the complexity of some quadratic Euclidean 2-clustering problems (Q2630045) (← links)
- Clustering cities based on their development dynamics and variable neigborhood search (Q2631267) (← links)
- Compressive statistical learning with random feature moments (Q2664824) (← links)
- Statistical learning guarantees for compressive clustering and compressive mixture modeling (Q2664825) (← links)
- Visual attractiveness in vehicle routing via bi-objective optimization (Q2669616) (← links)
- Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering (Q2670543) (← links)
- An exact algorithm for semi-supervised minimum sum-of-squares clustering (Q2676354) (← links)
- On the complexity of redescription mining (Q2680177) (← links)
- Balanced \(k\)-means clustering on an adiabatic quantum computer (Q2685586) (← links)
- On the Complexity of Clustering with Relaxed Size Constraints (Q2830056) (← links)
- Degeneracy on \(K\)-means clustering (Q2840745) (← links)
- Exact pseudopolynomial algorithms for a balanced 2-clustering problem (Q2959183) (← links)
- Mathematical Programming Formulations and Algorithms for Discrete <i>k</i>-Median Clustering of Time-Series Data (Q2967621) (← links)
- The Complexity Status of Problems Related to Sparsest Cuts (Q3000501) (← links)
- A Bad Instance for k-Means++ (Q3010415) (← links)
- An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors (Q3186839) (← links)
- A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem (Q3186861) (← links)
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
- Real-Time Valuation of Large Variable Annuity Portfolios: A Green Mesh Approach (Q3385433) (← links)
- The Planar k-Means Problem is NP-Hard (Q3605504) (← links)
