{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:32:49Z","timestamp":1773246769116,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030967710","type":"print"},{"value":"9783030967727","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-96772-7_39","type":"book-chapter","created":{"date-parts":[[2022,3,15]],"date-time":"2022-03-15T21:13:08Z","timestamp":1647378788000},"page":"430-440","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Distributed Fair k-Center Clustering Problems with Outliers"],"prefix":"10.1007","author":[{"given":"Fan","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Luhong","family":"Diao","sequence":"additional","affiliation":[]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"key":"39_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-540-87744-8_6","volume-title":"Algorithms - ESA 2008","author":"PK Agarwal","year":"2008","unstructured":"Agarwal, P.K., Phillips, J.M.: An efficient algorithm for 2D Euclidean 2-center with outliers. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 64\u201375. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87744-8_6"},{"key":"39_CR2","doi-asserted-by":"publisher","unstructured":"Guha, S., Rastogi, R., Shim, K.: Techniques for clustering massive data sets. In: Clustering and Information Retrieval Network Theory and Applications, vol. 11, pp. 35\u201382. Springer, Boston (2004). https:\/\/doi.org\/10.1007\/978-1-4613-0227-8_2","DOI":"10.1007\/978-1-4613-0227-8_2"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Hassani, M., Mller, E., Seidl, T.: EDISKCO: energy efficient distributed in-sensor-network $$k$$-center clustering with outliers. In: KDD Workshop on Knowledge Discovery from Sensor Data, pp. 39\u201348 (2009)","DOI":"10.1145\/1601966.1601975"},{"key":"39_CR4","unstructured":"Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: SODA, pp. 642\u2013651 (2001)"},{"issue":"7","key":"39_CR5","doi-asserted-by":"publisher","first-page":"622","DOI":"10.14778\/2180912.2180915","volume":"5","author":"B Bahmani","year":"2012","unstructured":"Bahmani, B., Moseley, B., Vattani, A., Kumar, R., Vassilvitskii, S.: Scalable $$k$$-Means++. Proc. VLDB Endow 5(7), 622\u2013633 (2012)","journal-title":"Proc. VLDB Endow"},{"key":"39_CR6","unstructured":"Balcan, M.-F., Ehrlich, S., Liang, Y.: Distributed $$k$$-means and $$k$$-median clustering on general communication topologies. In: NIPS, pp. 1995\u20132003 (2013)"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Ene, A., Im, S., Moseley, B.: Fast clustering using MapReduce. KDD, pp. 681\u2013689 (2011)","DOI":"10.1145\/2020408.2020515"},{"key":"39_CR8","unstructured":"Mirzasoleiman, B., Karbasi, A., Sarkar, R., Krause, A.: Distributed submodular maximization: identifying representative elements in massive data. In: NIPS, pp. 2049\u20132057 (2013)"},{"key":"39_CR9","unstructured":"Chiplunkar, A., Kale, S., Ramamoorthy, S.N.: How to solve fair $$k$$-center in massive data models. In: ICML, pp. 1877\u20131886 (2020)"},{"key":"39_CR10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0167-6377(85)90002-1","volume":"3","author":"M Dyer","year":"1985","unstructured":"Dyer, M., Frieze, A.: A simple heuristic for the $$p$$-center problem. Oper. Res. Lett. 3, 285\u2013288 (1985)","journal-title":"Oper. Res. Lett."},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"Ahmadian, S., Epasto, A., Kumar, R., Mahdian, M.: Clustering without over-representation. In: KDD, pp. 267\u2013275 (2019)","DOI":"10.1145\/3292500.3330987"},{"key":"39_CR12","unstructured":"Bera, S.K., Chakrabarty, D., Flores, N., Negahbani, M.: Fair algorithms for clustering. In: NeurIPS, pp. 4955\u20134966 (2019)"},{"key":"39_CR13","unstructured":"Bandyapadhyay, S., Inamdar, T., Pai, S., Varadarajan, K.R.: A constant approximation for colorful $$k$$-center. ESA, 12:1\u201312:14 (2019)"},{"key":"39_CR14","unstructured":"Chierichetti, F., Kumar, R., Lattanzi, S., Vassilvitskii, S.: Fair clustering through fairlets. In: NIPS, pp. 5029\u20135037 (2017)"},{"issue":"1","key":"39_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00453-015-0010-1","volume":"75","author":"DZ Chen","year":"2015","unstructured":"Chen, D.Z., Li, J., Liang, H., Wang, H.: Matroid and knapsack center problems. Algorithmica 75(1), 27\u201352 (2015). https:\/\/doi.org\/10.1007\/s00453-015-0010-1","journal-title":"Algorithmica"},{"key":"39_CR16","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"F Teofilo","year":"1985","unstructured":"Teofilo, F.: Gonzalez: clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"39_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-642-15775-2_27","volume-title":"Algorithms \u2013 ESA 2010","author":"MT Hajiaghayi","year":"2010","unstructured":"Hajiaghayi, M.T., Khandekar, R., Kortsarz, G.: Budgeted red-blue median and its generalizations. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6346, pp. 314\u2013325. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15775-2_27"},{"issue":"3","key":"39_CR18","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0166-218X(79)90044-1","volume":"1","author":"W-L Hsu","year":"1979","unstructured":"Hsu, W.-L., Nemhauser, G.L.: Easy and hard bottleneck location problems. Discret. Appl. Math. 1(3), 209\u2013215 (1979)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"39_CR19","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the $$k$$-center problem. Math. Oper. Res. 10(2), 180\u2013184 (1985)","journal-title":"Math. Oper. Res."},{"key":"39_CR20","doi-asserted-by":"publisher","unstructured":"Jia, X., Sheth, K., Svensson, O.: Fair colorful k-center clustering. Math. Program. 1\u201322 (2021). https:\/\/doi.org\/10.1007\/s10107-021-01674-7","DOI":"10.1007\/s10107-021-01674-7"},{"key":"39_CR21","unstructured":"Kale, S.: Small space stream summary for matroid center. APPROX-RANDOM, 20:1\u201320:22 (2019)"},{"key":"39_CR22","unstructured":"Kleindessner, M., Awasthi, P., Morgenstern, J.: Fair $$k$$-center clustering for data summarization. In: ICML, pp. 3448\u20133457 (2019)"},{"key":"39_CR23","doi-asserted-by":"crossref","unstructured":"Krishnaswamy, R., Kumar, A., Nagarajan, V., Sabharwal, Y., Saha, B.: The matroid median problem. In: SODA, pp. 1117\u20131130 (2011)","DOI":"10.1137\/1.9781611973082.84"},{"key":"39_CR24","doi-asserted-by":"crossref","unstructured":"Kay, M., Matuszek, C., Munson, S.A.: Unequal representation and gender stereotypes in image search results for occupations. In: CHI, pp. 3819\u20133828 (2015)","DOI":"10.1145\/2702123.2702520"},{"key":"39_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-030-39479-0_16","volume-title":"Approximation and Online Algorithms","author":"M Schmidt","year":"2020","unstructured":"Schmidt, M., Schwiegelshohn, C., Sohler, C.: Fair coresets and streaming algorithms for fair k-means. In: Bampis, E., Megow, N. (eds.) WAOA 2019. LNCS, vol. 11926, pp. 232\u2013251. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39479-0_16"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing, Applications and Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-96772-7_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,15]],"date-time":"2022-03-15T21:19:22Z","timestamp":1647379162000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-96772-7_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030967710","9783030967727"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-96772-7_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PDCAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel and Distributed Computing: Applications and Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pdcat2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cse.sysu.edu.cn\/pdcat2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"97","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":"24","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":"34","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":"25% - 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":"7","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}