scientific article; zbMATH DE number 7051277
From MaRDI portal
Publication:4633921
zbMath1422.68287MaRDI QIDQ4633921
Anupam Gupta, Maria-Florina Balcan, Avrim L. Blum
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496886
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (8)
A refined approximation for Euclidean \(k\)-means ⋮ Clustering with or without the approximation ⋮ Discrete facility location in machine learning ⋮ Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms ⋮ Unnamed Item ⋮ Data stability in clustering: a closer look ⋮ Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics ⋮ Decompositions of Triangle-Dense Graphs
This page was built for publication:
