Near-Optimal Clustering in the k-machine model-Reference-Cited by-同舟云学术

Near-Optimal Clustering in the k-machine model

Published:2018-01-04 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 19th International Conference on Distributed Computing and Networking
language:
Short-container-title:

Author:

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

Affiliation:

1. The University of Iowa

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3154273.3154317

Reference30 articles.

1. A Biological Solution to a Fundamental Distributed Computing Problem

2. The space complexity of approximating the frequency moments

3. Aaron Archer Ranjithkumar Rajagopalan and David B. Shmoys. 2003. Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties. In Algorithms - ESA 2003: 11th Annual European Symposium Budapest Hungary September 16-19 2003. Proceedings Giuseppe Di Battista and Uri Zwick (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 31--42. Aaron Archer Ranjithkumar Rajagopalan and David B. Shmoys. 2003. Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties. In Algorithms - ESA 2003: 11th Annual European Symposium Budapest Hungary September 16-19 2003. Proceedings Giuseppe Di Battista and Uri Zwick (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 31--42.

4. Local search heuristic for k-median and facility location problems

5. S. Bandyapadhyay T. Inamdar S. Pai and S. V. Pemmaraju. 2017. Near-Optimal Clustering in the k -machine model. ArXiv e-prints (Oct. 2017). arXiv:cs.DC/1710.08381 S. Bandyapadhyay T. Inamdar S. Pai and S. V. Pemmaraju. 2017. Near-Optimal Clustering in the k -machine model. ArXiv e-prints (Oct. 2017). arXiv:cs.DC/1710.08381

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Distributed Algorithms for Connectivity and MST in Large Graphs with Efficient Local Computation;Proceedings of the 23rd International Conference on Distributed Computing and Networking;2022-01-04

2. Near-optimal clustering in the k-machine model;Theoretical Computer Science;2022-01

3. Discrete Facility Location in Machine Learning;Journal of Applied and Industrial Mathematics;2021-11

4. On the Distributed Complexity of Large-Scale Graph Computations;ACM Transactions on Parallel Computing;2021-06-30

5. Efficient Distributed Algorithms in the k-machine model via PRAM Simulations;2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2021-05