Near-optimal clustering in the \(k\)-machine model
type: Item
instance of: scholarly article
title: Near-optimal clustering in the \(k\)-machine model
author: Sayan Bandyapadhyay
author: Tanmay Inamdar
author: Shreyas Pai
author: Sriram Pemmaraju
published in: Theoretical Computer Science
publication date: 2021-12-22T00:00:00Z
full work available at URL: https://arxiv.org/abs/1710.08381
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7450575
zbMATH Keywords: clustering
zbMATH Keywords: facility location
zbMATH Keywords: \(k\)-median
zbMATH Keywords: \(k\)-center
zbMATH Keywords: \(k\)-machine model
zbMATH Keywords: large-scale clustering
zbMATH Keywords: distributed clustering
MaRDI profile type: Publication
OpenAlex ID: W3214748966
cites work: Data stream clustering
cites work: Q4228450
cites work: Distributed Computation of Large-scale Graph Problems
cites work: Q4250234
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
cites work: The Online Median Problem
cites work: A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
cites work: A new greedy approach for facility location problems
cites work: Local search heuristic for k-median and facility location problems
cites work: Clustering to minimize the maximum intercluster distance
cites work: Quick k-Median, k-Center, and Facility Location for Sparse Graphs
cites work: Size-estimation framework with applications to transitive closure and reachability
cites work: Algorithms for facility location problems with outliers. (Extended abstract)
cites work: Q5417679
cites work: The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation
cites work: Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation
cites work: Elements of Information Theory
cites work: Toward optimal bounds in the congested clique, graph connectivity and MST
cites work: On the power of the congested clique model
cites work: Fast Approximate Shortest Paths in the Congested Clique
cites work: Exponentially Faster Shortest Paths in the Congested Clique
cites work: Sub-logarithmic distributed algorithms for metric facility location
cites work: Algorithms - ESA 2003
cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem
cites work: A Biological Solution to a Fundamental Distributed Computing Problem
cites work: The complexity of symmetry breaking in massive graphs
cites work: Near-optimal approximate shortest paths and transshipment in distributed and streaming models
DOI: 10.1016/J.TCS.2021.11.026
description: scientific article; zbMATH DE number 7450575