scientific article; zbMATH DE number 7561511

DOI10.4230/LIPIcs.ICALP.2019.18MaRDI QIDQ5091167

David P. Woodruff, Colin White, Pranjal Awasthi, Ainesh Bakshi, Maria-Florina Balcan

Publication date: 21 July 2022

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

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

zbMATH Keywords

communication complexityrobust distributed clustering

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An information statistics approach to data stream and communication complexity
• Clustering to minimize the maximum intercluster distance
• On the distributional complexity of disjointness
• Decompositions of Triangle-Dense Graphs
• A constant-factor approximation algorithm for the k -median problem (extended abstract)
• Are Stable Instances Easy?
• Dimensionality Reduction for k-Means Clustering and Low Rank Approximation
• Communication complexity of approximate matching in distributed graphs
• A local search approximation algorithm for k-means clustering
• A Bi-Criteria Approximation Algorithm for k-Means
• Constant approximation for k-median and k-means with outliers via iterative rounding
• An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization
• The effectiveness of lloyd-type methods for the k-means problem

This page was built for publication: