Near-constant-time distributed algorithms on a congested clique

DOI10.1007/978-3-662-45174-8_35MaRDI QIDQ6534374zbMATH OpenFDO

Authors James W. Hegeman, Sriram Pemmaraju, Vivek B. Sardeshmukh

Publication date 10 February 2015

Full work available at URL https://doi.org/10.1007/978-3-662-45174-8_35

Mathematics Subject Classification ID

Distributed algorithms (68W15) Approximation algorithms (68W25) Discrete location and assignment (90B80)

Recommendations

• Super-fast distributed algorithms for metric facility location
• Sub-logarithmic distributed algorithms for metric facility location
• Fast Approximate Shortest Paths in the Congested Clique
• Exponentially Faster Shortest Paths in the Congested Clique
• Fast approximate shortest paths in the congested clique

Cited in

(8)

• Fooling views: a new lower bound technique for distributed computations under congestion
• A note on improved results for one round distributed clique listing
• Distributed Approximation Algorithm for Resource Clustering
• Efficient distributed algorithms by using the archimedean time assumption
• scientific article; zbMATH DE number 6861895 (Why is no real title available?)
• Does Preprocessing Help under Congestion?
• Lessons from the Congested Clique Applied to MapReduce
• Fully-scalable MPC algorithms for clustering in high dimension

This page was built for publication: Near-constant-time distributed algorithms on a congested clique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6534374)