{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:32:09Z","timestamp":1743143529750,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031304477"},{"type":"electronic","value":"9783031304484"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30448-4_27","type":"book-chapter","created":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T20:29:36Z","timestamp":1682368176000},"page":"383-398","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Communication-Efficient Distributed Graph Clustering and\u00a0Sparsification Under Duplication Models"],"prefix":"10.1007","author":[{"given":"Chun Jiang","family":"Zhu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,25]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Abboud, A., Bodwin, G.: The 4\/3 additive spanner exponent is tight. In: Proceedings of the ACM STOC Conference, pp. 351\u2013361 (2016)","DOI":"10.1145\/2897518.2897555"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Ahmed, R., et al.: Graph spanners: a tutorial review. Comput. Sci. Rev. 37, 100253 (2020)","DOI":"10.1016\/j.cosrev.2020.100253"},{"issue":"1","key":"27_CR3","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02189308","volume":"9","author":"I Alth\u00f6fer","year":"1993","unstructured":"Alth\u00f6fer, I., Das, G., Dobkin, D., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discret. Comput. Geom. 9(1), 81\u2013100 (1993). https:\/\/doi.org\/10.1007\/BF02189308","journal-title":"Discret. Comput. Geom."},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Baswana, S., Kavitha, T., Mehlhorn, K., Pettie, S.: Additive spanners and $$(\\alpha ,\\beta )$$-spanners. ACM Trans. Algorithms 7(1) (2010)","DOI":"10.1145\/1868237.1868242"},{"key":"27_CR5","unstructured":"Braverman, M., Oshman, R.: The communication complexity of number-in-hand set disjointness with no promise. Electron. Colloq. Comput. Complex 22, 2 (2015)"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Chechik, S.: New additive spanners. In: Proceedings of the SIAM SODA Conference, pp. 498\u2013512 (2013)","DOI":"10.1137\/1.9781611973105.36"},{"issue":"3","key":"27_CR7","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s00446-017-0306-2","volume":"31","author":"K Censor-Hillel","year":"2018","unstructured":"Censor-Hillel, K., Kavitha, T., Paz, A., Yehudayoff, A.: Distributed construction of purely additive spanners. Distrib. Comput. 31(3), 223\u2013240 (2018)","journal-title":"Distrib. Comput."},{"key":"27_CR8","unstructured":"Chen, J., Sun, H., Woodruff, D.P., Zhang, Q.: Communication-optimal distributed clustering. In: Proceedings of the NIPS Conference, pp. 3720\u20133728 (2016)"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Oshman, R., Roth, T.: The communication complexity of multiparty set disjointness under product distributions. In: Proceedings of the ACM STOC Conference, pp. 1194\u20131207 (2021)","DOI":"10.1145\/3406325.3451106"},{"key":"27_CR10","unstructured":"Erdos, P.: Extremal problems in graph theory. Theory of Graphs and Its Applications, pp. 29\u201336 (1964)"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Fung, W.S., Hariharan, R., Harvey, N.J.A., Panigrahi, D.: A general framework for graph sparsification. In: Proceedings of the ACM STOC Conference, pp. 71\u201380 (2011)","DOI":"10.1145\/1993636.1993647"},{"key":"27_CR12","unstructured":"Fernandez, M.V., Woodruff, D.P., Yasuda, T.: Graph spanners in the message-passing model. In: Proceedings of the ITCS Conference (2020)"},{"issue":"2","key":"27_CR13","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/2948062","volume":"3","author":"I Koutis","year":"2016","unstructured":"Koutis, I., Xu, S.C.: Simple parallel and distributed algorithms for spectral graph sparsification. ACM Trans. Parallel Comput. 3(2), 14 (2016)","journal-title":"ACM Trans. Parallel Comput."},{"key":"27_CR14","unstructured":"Ng, A.Y., Jordan, M.I., Weiss, Y.: On spectral clustering: analysis and an algorithm. In Proceedings of the NIPS Conference, pp. 849\u2013856 (2001)"},{"key":"27_CR15","unstructured":"Peng, R., Sun, H., Zanetti, L.: Partitioning well-clustered graphs: spectral clustering works! In: Proceedings of the COLT Conference, pp. 1423\u20131455 (2015)"},{"issue":"1","key":"27_CR16","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1137\/15M1007525","volume":"45","author":"JM Phillips","year":"2016","unstructured":"Phillips, J.M., Verbin, E., Zhang, Q.: Lower bounds for number-in-hand multiparty communication complexity, made easy. SIAM J. Comput. 45(1), 174\u2013196 (2016)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"27_CR17","doi-asserted-by":"publisher","first-page":"1913","DOI":"10.1137\/080734029","volume":"40","author":"DA Spielman","year":"2011","unstructured":"Spielman, D.A., Srivastava, N.: Graph sparsification by effective resistances. SIAM J. Comput. 40(6), 1913\u20131926 (2011)","journal-title":"SIAM J. Comput."},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Spielman, D.A., Teng, S.-H.: Spectral sparsification of graphs. SIAM J. Comput. 40(4), 981\u20131025 (2011)","DOI":"10.1137\/08074489X"},{"issue":"3","key":"27_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/3364208","volume":"6","author":"H Sun","year":"2019","unstructured":"Sun, H., Zanetti, L.: Distributed graph clustering and sparsification. ACM Trans. Parallel Comput. 6(3), 17 (2019)","journal-title":"ACM Trans. Parallel Comput."},{"issue":"1","key":"27_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1044731.1044732","volume":"52","author":"M Thorup","year":"2005","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. J. ACM 52(1), 1\u201324 (2005)","journal-title":"J. ACM"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Vempala, S.S., Wang, R., Woodruff, D.P.: The communication complexity of optimization. In: Proceedings of the SIAM SODA Conference, pp. 1733\u20131752. SIAM (2020)","DOI":"10.1137\/1.9781611975994.106"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Woodruff, D.P., Zhang, Q.: Tight bounds for distributed functional monitoring. In: Proceedings of the ACM STOC Conference, pp. 941\u2013960 (2012)","DOI":"10.1145\/2213977.2214063"},{"key":"27_CR23","unstructured":"Yang, W., Xu, H.: A divide and conquer framework for distributed graph clustering. In: Proceedings of the ICML Conference, pp. 504\u2013513 (2015)"},{"key":"27_CR24","unstructured":"Zhu, C., Liu, Q., Bi, J.: Spectral vertex sparsifiers and pair-wise spanners over distributed graphs. In: Proceedings of the ICML Conference, pp. 12890\u201312900 (2021)"},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"Zhu, C.J., Zhu, T., Lam, K.Y., Han, S., Bi, J.: Communication-optimal distributed dynamic graph clustering. In: Proceedings of the AAAI Conference, pp. 5957\u20135964 (2019)","DOI":"10.1609\/aaai.v33i01.33015957"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30448-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T23:05:17Z","timestamp":1684191917000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30448-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031304477","9783031304484"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30448-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Larnaca","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}