{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:01:15Z","timestamp":1774368075767,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,1,4]],"date-time":"2018-01-04T00:00:00Z","timestamp":1515024000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,1,4]]},"DOI":"10.1145\/3154273.3154317","type":"proceedings-article","created":{"date-parts":[[2018,1,12]],"date-time":"2018-01-12T13:49:57Z","timestamp":1515764997000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Near-Optimal Clustering in the k-machine model"],"prefix":"10.1145","author":[{"given":"Sayan","family":"Bandyapadhyay","sequence":"first","affiliation":[{"name":"The University of Iowa"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tanmay","family":"Inamdar","sequence":"additional","affiliation":[{"name":"The University of Iowa"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shreyas","family":"Pai","sequence":"additional","affiliation":[{"name":"The University of Iowa"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sriram V.","family":"Pemmaraju","sequence":"additional","affiliation":[{"name":"The University of Iowa"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,1,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1193210"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237823"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/978-3-540-39658-1_6"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380755"},{"key":"e_1_3_2_1_5_1","unstructured":"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"},{"key":"e_1_3_2_1_6_1","unstructured":"Ruben Becker Andreas Karrenbauer Sebastian Krinninger and Christoph Lenzen. 2016. Approximate Undirected Transshipment and Shortest Paths via Gradient Descent. CoRR abs\/1607.05127 (2016). http:\/\/arxiv.org\/abs\/1607.05127  Ruben Becker Andreas Karrenbauer Sebastian Krinninger and Christoph Lenzen. 2016. Approximate Undirected Transshipment and Shortest Paths via Gradient Descent. CoRR abs\/1607.05127 (2016). http:\/\/arxiv.org\/abs\/1607.05127"},{"key":"e_1_3_2_1_7_1","volume-title":"31st International Symposium on Distributed Computing (DISC 2017) (Leibniz International Proceedings in Informatics (LIPIcs)), Andr\u00e9a W","author":"Becker Ruben"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1534"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2411606"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629175.1629198"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611493"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020515"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806508"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '98)","author":"Guha Sudipto","year":"1998"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767434"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510012"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375845"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2722129.2722157"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/2027223.2027230"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701383443"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935785"},{"key":"e_1_3_2_1_27_1","unstructured":"Gopal Pandurangan Peter Robinson and Michele Scquizzato. 2016. Tight Bounds for Distributed Graph Computations. CoRR abs\/1602.08481 (2016). http:\/\/arxiv.org\/abs\/1602.08481  Gopal Pandurangan Peter Robinson and Michele Scquizzato. 2016. Tight Bounds for Distributed Graph Computations. CoRR abs\/1602.08481 (2016). http:\/\/arxiv.org\/abs\/1602.08481"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2522968.2522981"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701388884"},{"key":"e_1_3_2_1_30_1","unstructured":"G. Yaroslavtsev and A. Vadapalli. 2017. Massively Parallel Algorithms and Hardness for Single-Linkage Clustering Under ℓ_p -Distances. ArXiv e-prints (Oct. 2017). arXiv:cs.DS\/1710.01431  G. Yaroslavtsev and A. Vadapalli. 2017. Massively Parallel Algorithms and Hardness for Single-Linkage Clustering Under ℓ_p -Distances. ArXiv e-prints (Oct. 2017). arXiv:cs.DS\/1710.01431"}],"event":{"name":"ICDCN '18: 19th International Conference on Distributed Computing and Networking","location":"Varanasi India","acronym":"ICDCN '18","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing","SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the 19th International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3154273.3154317","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3154273.3154317","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:26Z","timestamp":1750212686000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3154273.3154317"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,4]]},"references-count":30,"alternative-id":["10.1145\/3154273.3154317","10.1145\/3154273"],"URL":"https:\/\/doi.org\/10.1145\/3154273.3154317","relation":{},"subject":[],"published":{"date-parts":[[2018,1,4]]},"assertion":[{"value":"2018-01-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}