Near-optimal clustering in the \(k\)-machine model

DOI10.1016/j.tcs.2021.11.026OpenAlexW3214748966MaRDI QIDQ2062125

Shreyas Pai, Sriram V. Pemmaraju, Sayan Bandyapadhyay, Tanmay Inamdar

Publication date: 22 December 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

clusteringfacility location\(k\)-center\(k\)-mediandistributed clustering\(k\)-machine modellarge-scale clustering

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Discrete facility location in machine learning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sub-logarithmic distributed algorithms for metric facility location
• Clustering to minimize the maximum intercluster distance
• Size-estimation framework with applications to transitive closure and reachability
• Toward Optimal Bounds in the Congested Clique
• On the power of the congested clique model
• A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
• A Biological Solution to a Fundamental Distributed Computing Problem
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• A new greedy approach for facility location problems
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• Quick k-Median, k-Center, and Facility Location for Sparse Graphs
• The Online Median Problem
• Fast Approximate Shortest Paths in the Congested Clique
• The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation
• Local search heuristic for k-median and facility location problems
• Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation
• Distributed Computation of Large-scale Graph Problems
• Data stream clustering
• Elements of Information Theory
• Exponentially Faster Shortest Paths in the Congested Clique
• Algorithms - ESA 2003

This page was built for publication: Near-optimal clustering in the \(k\)-machine model