{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T11:40:08Z","timestamp":1751197208010,"version":"3.41.0"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819683116","type":"print"},{"value":"9789819683123","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-8312-3_10","type":"book-chapter","created":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T11:02:03Z","timestamp":1751194923000},"page":"128-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithms for\u00a0Individual Preference Facility Location"],"prefix":"10.1007","author":[{"given":"Shuilian","family":"Liu","sequence":"first","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":[[2025,6,30]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Abbasi, M., Bhaskara, A., Venkatasubramanian, S.: Fair clustering via equitable group representations. In: Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency (FAccT), pp. 504\u2013514 (2021)","DOI":"10.1145\/3442188.3445913"},{"key":"10_CR2","unstructured":"Bandyapadhyay, S., Inamdar, T., Pai, S., Varadarajan, K.: A constant approximation for colorful k-center. In: 27th Annual European Symposium on Algorithms (ESA). Schloss-Dagstuhl-Leibniz Zentrum f\u00fcr Informatik (2019)"},{"key":"10_CR3","unstructured":"Bateni, M., Cohen-Addad, V., Epasto, A., Lattanzi, S.: Scalable and improved algorithms for individually fair clustering. In: Workshop on Trustworthy and Socially Responsible Machine Learning, NeurIPS (2022)"},{"key":"10_CR4","unstructured":"Bateni, M., Cohen-Addad, V., Epasto, A., Lattanzi, S.: A scalable algorithm for individually fair $$k$$-means clustering. In: International Conference on Artificial Intelligence and Statistics (AISTATS), pp. 3151\u20133159 (2024)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and $$k$$-median problems. In: 40th Annual Symposium on Foundations of Computer Science (FOCS), pp. 378\u2013388 (1999)","DOI":"10.1109\/SFFCS.1999.814609"},{"key":"10_CR6","unstructured":"Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), vol.\u00a01, pp. 642\u2013651 (2001)"},{"key":"10_CR7","unstructured":"Chhaya, R., Dasgupta, A., Choudhari, J., Shit, S.: On coresets for fair regression and individually fair clustering. In: International Conference on Artificial Intelligence and Statistics (AISTATS), pp. 9603\u20139625 (2022)"},{"key":"10_CR8","first-page":"1","volume":"30","author":"F Chierichetti","year":"2017","unstructured":"Chierichetti, F., Kumar, R., Lattanzi, S., Vassilvitskii, S.: Fair clustering through fairlets. Adv. Neural Inf. Process. Syst. (NeurIPS) 30, 1\u20139 (2017)","journal-title":"Adv. Neural Inf. Process. Syst. (NeurIPS)"},{"key":"10_CR9","unstructured":"Ebbens, M., Funk, N., H\u00f6ckendorff, J., Sohler, C., Weil, V.: A subquadratic time approximation algorithm for individually fair $$k$$-center. arXiv preprint arXiv:2412.04943 (2024)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Ghadiri, M., Samadi, S., Vempala, S.: Socially fair k-means clustering. In: Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency (FAccT), pp. 438\u2013448 (2021)","DOI":"10.1145\/3442188.3445906"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1006\/jagm.1998.0993","volume":"31","author":"S Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. J. Algorithms 31(1), 228\u2013248 (1999)","journal-title":"J. Algorithms"},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s10898-022-01195-3","volume":"87","author":"L Han","year":"2023","unstructured":"Han, L., Xu, D., Xu, Y., Yang, P.: Approximation algorithms for the individually fair $$k$$-center with outliers. J. Global Optim. 87(2), 603\u2013618 (2023)","journal-title":"J. Global Optim."},{"issue":"6","key":"10_CR13","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1145\/950620.950621","volume":"50","author":"K Jain","year":"2003","unstructured":"Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM 50(6), 795\u2013824 (2003)","journal-title":"J. ACM"},{"issue":"2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.V.: Approximation algorithms for metric facility location and $$k$$-median problems using the primal-dual schema and Lagrangian relaxation. J. ACM (JACM) 48(2), 274\u2013296 (2001)","journal-title":"J. ACM (JACM)"},{"key":"10_CR15","unstructured":"Jung, C., Kannan, S., Lutz, N.: Service in your neighborhood: fairness in center location. In: 1st Symposium on Foundations of Responsible Computing (FORC), pp. 5:1\u20135:15 (2020)"},{"issue":"1","key":"10_CR16","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1006\/jagm.2000.1100","volume":"37","author":"MR Korupolu","year":"2000","unstructured":"Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. J. Algorithms 37(1), 146\u2013188 (2000)","journal-title":"J. Algorithms"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Li, S.: A 1.488 approximation algorithm for the uncapacitated facility location problem. Inf. Computat. 222, 45\u201358 (2013)","DOI":"10.1016\/j.ic.2012.01.007"},{"key":"10_CR18","unstructured":"Mahabadi, S., Vakilian, A.: Individual fairness for $$k$$-clustering. In: International Conference on Machine Learning (ICML), pp. 6586\u20136596 (2020)"},{"key":"10_CR19","unstructured":"Maity, B., Das, S., Dasgupta, A.: Linear programming based approximation to individually fair $$k$$-clustering with outliers. arXiv preprint arXiv:2412.10923 (2024)"},{"key":"10_CR20","first-page":"13340","volume":"34","author":"M Negahbani","year":"2021","unstructured":"Negahbani, M., Chakrabarty, D.: Better algorithms for individually fair $$ k $$-clustering. Adv. Neural. Inf. Process. Syst. 34, 13340\u201313351 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tardos, \u00c9., Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of the ACM Symposium on Theory of Computing (STOC), pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"key":"10_CR22","unstructured":"Vakilian, A., Yalciner, M.: Improved approximation algorithms for individually fair clustering. In: International Conference on Artificial Intelligence and Statistics (AISTATS), pp. 8758\u20138779 (2022)"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-8312-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T11:02:07Z","timestamp":1751194927000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-8312-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819683116","9789819683123"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-8312-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"30 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijtcs-faw.github.io\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}