Fully-scalable MPC algorithms for clustering in high dimension
From MaRDI portal
Cites work
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A bi-criteria approximation algorithm for \(k\)-means
- A distributed O(1)-approximation algorithm for the uniform facility location problem
- A new coreset framework for clustering
- Adaptive Sampling for k-Means Clustering
- Algorithms for dynamic geometric problems over data streams
- Almost 3-approximate correlation clustering in constant rounds
- An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
- Approximation algorithms for geometric median problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Are stable instances easy?
- Automata, Languages and Programming
- Communication steps for parallel query processing
- Component Stability in Low-Space Massively Parallel Computation
- Conditional hardness results for massively parallel computation from distributed lower bounds
- Dynamic facility location via exponential clocks
- Extensions of Lipschitz mappings into a Hilbert space
- Fully scalable massively parallel algorithms for embedded planar graphs
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- scientific article; zbMATH DE number 6297759 (Why is no real title available?)
- Local Search Heuristics for k-Median and Facility Location Problems
- Massively parallel algorithms for high-dimensional Euclidean minimum spanning tree
- Near-constant-time distributed algorithms on a congested clique
- New streaming algorithms for high dimensional EMD and MST
- On coresets for k-means and k-median clustering
- Parallel algorithms for geometric graph problems
- Scattering and sparse partitions, and their applications
- Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)
- Sorting, searching, and simulation in the MapReduce framework
- Streaming Euclidean MST to a constant factor
- Streaming facility location in high dimension via geometric hashing
- Sub-logarithmic distributed algorithms for metric facility location
- The Online Median Problem
- The power of uniform sampling for coresets
- Towards optimal lower bounds for k-median and k-means coresets
- Universal approximations for TSP, Steiner tree, and set cover
This page was built for publication: Fully-scalable MPC algorithms for clustering in high dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875152)
