scientific article; zbMATH DE number 7164753

zbMath1442.68265arXiv1809.02271MaRDI QIDQ5214247

Shi Li, David G. Harris, Khoa Trinh, Aravind Srinivasan, Thomas W. Pensyl

Publication date: 7 February 2020

Full work available at URL: https://arxiv.org/abs/1809.02271

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

zbMATH Keywords

clusteringapproximation algorithms\(k\)-center\(k\)-medianlottery

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• A local search approximation algorithm for \(k\)-means clustering
• On approximate geometric \(k\)-clustering
• Fairness through awareness
• A Dependent LP-Rounding Approach for the k-Median Problem
• A new greedy approach for facility location problems
• A PTAS for k-means clustering based on weak coresets
• Greedy Strikes Back: Improved Facility Location Algorithms
• Stochastic k-Center and j-Flat-Center Problems
• Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
• An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
• A Lottery Model for Center-Type Problems With Outliers
• A Lottery Model for Center-Type Problems with Outliers
• Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
• Constant approximation for k-median and k-means with outliers via iterative rounding
• On the Concentration of the Domination Number of the Random Graph

This page was built for publication: