scientific article
From MaRDI portal
Publication:2921753
zbMath1297.68241MaRDI QIDQ2921753
Bardia Sadri, Sariel Har-Peled
Publication date: 13 October 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
The planar \(k\)-means problem is NP-hard ⋮ A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems ⋮ Light Euclidean Spanners with Steiner Points ⋮ The seeding algorithm for \(k\)-means problem with penalties ⋮ A General Hybrid Clustering Technique
This page was built for publication:
