scientific article

zbMath1153.68385MaRDI QIDQ3601533

Sergei Vassilvitskii, David Arthur

Publication date: 10 February 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (18)

A refined approximation for Euclidean \(k\)-means ⋮ Tight lower bound instances for \(k\)-means++ in two dimensions ⋮ Clustering with or without the approximation ⋮ Using expert's rules as background knowledge in the ClusDM methodology ⋮ ABBA: adaptive Brownian bridge-based symbolic aggregation of time series ⋮ Nonlinear multicriteria clustering based on multiple dissimilarity matrices ⋮ Balanced \(k\)-means clustering on an adiabatic quantum computer ⋮ Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms ⋮ The planar \(k\)-means problem is NP-hard ⋮ Fast construction of correcting ensembles for legacy artificial intelligence systems: algorithms and a case study ⋮ EFFICIENT DYNAMIC HEDGING FOR LARGE VARIABLE ANNUITY PORTFOLIOS WITH MULTIPLE UNDERLYING ASSETS ⋮ Local Search Yields a PTAS for $k$-Means in Doubling Metrics ⋮ A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems ⋮ \(k\)-means requires exponentially many iterations even in the plane ⋮ A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering ⋮ The Planar k-Means Problem is NP-Hard ⋮ An approximation algorithm for the uniform capacitated \(k\)-means problem ⋮ The seeding algorithm for spherical \(k\)-means clustering with penalties

This page was built for publication: