{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:16:28Z","timestamp":1742940988099,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031203497"},{"type":"electronic","value":"9783031203503"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20350-3_33","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"402-413","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithms for\u00a0Diversity-Bounded Center Problems"],"prefix":"10.1007","author":[{"given":"Lu","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuilian","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yicheng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"33_CR1","unstructured":"Bandyapadhyay, S., Inamdar, T., Pai, S., Varadarajan, K.R.: A constant approximation for colorful $$k$$-center. In: Proceedings of the Annual European Symposium on Algorithms (ESA), pp. 1\u201314 (2019)"},{"issue":"2","key":"33_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2981561","volume":"13","author":"J Byrka","year":"2017","unstructured":"Byrka, J., Pensyl, T., Rybicki, B., Srinivasan, A., Trinh, K.: An improved approximation for $$k$$-median and positive correlation in budgeted optimization. ACM Trans. Algorithms 13(2), 1\u201331 (2017)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"33_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jcss.2002.1882","volume":"65","author":"M Charikar","year":"2002","unstructured":"Charikar, M., Guha, S., Tardos, \u00c9., Shmoys, D.B.: A constant-factor approximation algorithm for the $$k$$-median problem. J. Comput. Syst. Sci. 65(1), 129\u2013149 (2002)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"33_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00453-015-0010-1","volume":"75","author":"DZ Chen","year":"2016","unstructured":"Chen, D.Z., Li, J., Liang, H., Wang, H.: Matroid and knapsack center problems. Algorithmica 75(1), 27\u201352 (2016)","journal-title":"Algorithmica"},{"key":"33_CR5","unstructured":"Chierichetti, F., Kumar, R., Lattanzi, S., Vassilvitskii, S.: Fair clustering through fairlets. In: Proceedings of the Neural Information Processing Systems, pp. 5029\u20135037 (2017)"},{"key":"33_CR6","unstructured":"Friggstad, Z., Zhang, Y.: Tight analysis of a multiple-swap heurstic for budgeted red-blue median. In: Proceedings of the International Colloquium on Automata, Languages, and Programming, p. 75 (2016)"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Khandekar, R., Kortsarz, G.: Budgeted red-blue median and its generalizations. In: Proceedings of the European Symposium on Algorithms, pp. 314\u2013325 (2010)","DOI":"10.1007\/978-3-642-15775-2_27"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Han, L., Xu, D., Xu, Y., Yang, P.: Approximation algorithms for the individually fair $$k$$-center with outliers. J. Global Optim. 1\u201316 (2022)","DOI":"10.1007\/s10898-022-01195-3"},{"issue":"1","key":"33_CR10","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10107-021-01674-7","volume":"192","author":"X Jia","year":"2022","unstructured":"Jia, X., Sheth, K., Svensson, O.: Fair colorful $$k$$-center clustering. Math. Program. 192(1), 339\u2013360 (2022)","journal-title":"Math. Program."},{"key":"33_CR11","unstructured":"Jones, M., Nguyen, H., Nguyen, T.: Fair $$k$$-centers via maximum matching. In: Proceedings of the International Conference on Machine Learning, pp. 4940\u20134949 (2020)"},{"key":"33_CR12","unstructured":"Kleindessner, M., Samadi, S., Awasthi P., Morgenstern J.: Guarantees for spectral clustering with fairness constraints. In: Proceedings of the International Conference on Machine Learning, pp. 3458\u20133467 (2019)"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Krishnaswamy, R., Kumar, A., Nagarajan, V., Sabharwal, Y., Saha, B.: The matroid median problem. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1117\u20131130 (2011)","DOI":"10.1137\/1.9781611973082.84"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Lin, J.H., Vitter, J.S.: $$\\epsilon $$-Approximations with minimum packing constraint violation. In: Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 771\u2013782 (1992)","DOI":"10.1145\/129712.129787"},{"issue":"4","key":"33_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2963170","volume":"12","author":"C Swamy","year":"2016","unstructured":"Swamy, C.: Improved approximation algorithms for matroid and knapsack median problems and applications. ACM Trans. Algorithms 12(4), 1\u201322 (2016)","journal-title":"ACM Trans. Algorithms"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Thejaswi, S., Ordozgoiti, B., Gionis, A.: Diversity-aware $$k$$-median: Clustering with fair center representation. In: Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp. 765\u2013780 (2021)","DOI":"10.1007\/978-3-030-86520-7_47"},{"issue":"3","key":"33_CR17","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s11081-020-09503-0","volume":"21","author":"Y Xu","year":"2020","unstructured":"Xu, Y., M\u00f6hring, R.H., Xu, D., Zhang, Y., Zou, Y.: A constant FPT approximation algorithm for hard-capacitated $$k$$-means. Optim. Eng. 21(3), 709\u2013722 (2020)","journal-title":"Optim. Eng."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20350-3_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:27:01Z","timestamp":1672550821000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20350-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031203497","9783031203503"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20350-3_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lxy.tjut.edu.cn\/TAMC2022.htm","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","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":"33","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":"44% - 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)"}}]}}