scientific article; zbMATH DE number 7561433
From MaRDI portal
Publication:5091075
DOI10.4230/LIPIcs.OPODIS.2018.5MaRDI QIDQ5091075
Tanmay Inamdar, Shreyas Pai, Sriram V. Pemmaraju
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1811.06494
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
distributed algorithmsmassively parallel computationcongested cliquemetric facility location\(k\)-machine modelclustering with outliers
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sub-logarithmic distributed algorithms for metric facility location
- Lessons from the congested clique applied to MapReduce
- Algebraic methods in the congested clique
- The communication complexity of distributed task allocation
- The round complexity of distributed sorting
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- Sorting, Searching, and Simulation in the MapReduce Framework
- Super-Fast Distributed Algorithms for Metric Facility Location
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Communication Steps for Parallel Query Processing
- Quick k-Median, k-Center, and Facility Location for Sparse Graphs
- The Online Median Problem
- “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting
- Optimal deterministic routing and sorting on the congested clique
- Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
- Distributed approximation algorithms for weighted shortest paths
- Parallel algorithms for geometric graph problems
- Distributed Computation of Large-scale Graph Problems
- Distributed MIS via All-to-All Communication
- Data stream clustering
- Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
- Algorithms - ESA 2003
This page was built for publication:
