{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T10:10:10Z","timestamp":1746439810779,"version":"3.40.4"},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819644445","type":"print"},{"value":"9789819644452","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-4445-2_27","type":"book-chapter","created":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T09:34:19Z","timestamp":1746437659000},"page":"324-337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Approximation Algorithm for\u00a0Individual Fairness k-Median"],"prefix":"10.1007","author":[{"given":"Di","family":"Wu","sequence":"first","affiliation":[]},{"given":"Qilong","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,6]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Raghavan, P., Rao, S.: Approximation schemes for Euclidean $$k$$-medians and related problems. In: Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, pp. 106\u2013113 (1998)","DOI":"10.1145\/276698.276718"},{"issue":"3","key":"27_CR2","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1137\/S0097539702416402","volume":"33","author":"V Arya","year":"2004","unstructured":"Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for $$k$$-median and facility location problems. SIAM J. Comput. 33(3), 544\u2013562 (2004)","journal-title":"SIAM J. Comput."},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Gottlieb, L.A.: A linear time approximation scheme for Euclidean TSP. In: Proceedings of the 54th Annual Symposium on Foundations of Computer Science, pp. 698\u2013706 (2013)","DOI":"10.1109\/FOCS.2013.80"},{"issue":"3","key":"27_CR4","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1007\/s00453-018-0454-1","volume":"81","author":"B Behsaz","year":"2019","unstructured":"Behsaz, B., Friggstad, Z., Salavatipour, M.R., Sivakumar, R.: Approximation algorithms for min-sum $$k$$-clustering and balanced $$k$$-median. Algorithmica 81(3), 1006\u20131030 (2019)","journal-title":"Algorithmica"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Byrka, J., Pensyl, T.W., Rybicki, B., Srinivasan, A., Trinh, K.: An improved approximation for $$k$$-median and positive correlation in budgeted optimization. ACM Trans. Algorithms 13(2), 23:1\u201323:31 (2017)","DOI":"10.1145\/2981561"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Chalermsook, P., et al.: From Gap-ETH to FPT-inapproximability: clique, dominating set, and more. In: Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, pp. 743\u2013754 (2017)","DOI":"10.1109\/FOCS.2017.74"},{"issue":"1","key":"27_CR7","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."},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"105057","DOI":"10.1016\/j.cor.2020.105057","volume":"123","author":"RL Church","year":"2020","unstructured":"Church, R.L., Wang, S.: Solving the $$p$$-median problem on regular and lattice networks. Comput. Oper. Res. 123, 105057 (2020)","journal-title":"Comput. Oper. Res."},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V.: Approximation schemes for capacitated clustering in doubling metrics. In: Proceedings of the 31st ACM-SIAM Symposium on Discrete Algorithms, pp. 2241\u20132259 (2020)","DOI":"10.1137\/1.9781611975994.138"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V., Feldmann, A.E., Saulpic, D.: Near-linear time approximation schemes for clustering in doubling metrics. J. ACM 68(6), 44:1\u201344:34 (2021)","DOI":"10.1145\/3477541"},{"key":"27_CR11","unstructured":"Cohen-Addad, V., Gupta, A., Kumar, A., Lee, E., Li, J.: Tight FPT approximations for $$k$$-median and $$k$$-means. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, pp. 42:1\u201342:14 (2019)"},{"issue":"2","key":"27_CR12","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1137\/17M112717X","volume":"48","author":"V Cohen-Addad","year":"2019","unstructured":"Cohen-Addad, V., Klein, P.N., Mathieu, C.: Local search yields approximation schemes for $$k$$-means and $$k$$-median in Euclidean and minor-free metrics. SIAM J. Comput. 48(2), 644\u2013667 (2019)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"27_CR13","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1137\/17M1127181","volume":"48","author":"Z Friggstad","year":"2019","unstructured":"Friggstad, Z., Rezapour, M., Salavatipour, M.R.: Local search yields a PTAS for $$k$$-means in doubling metrics. SIAM J. Comput. 48(2), 452\u2013480 (2019)","journal-title":"SIAM J. Comput."},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Gowda, K.N., Pensyl, T.W., Srinivasan, A., Trinh, K.: Improved bi-point rounding algorithms and a golden barrier for $$k$$-median. In: Proceedings of the 34th ACM-SIAM Symposium on Discrete Algorithms, pp. 987\u20131011 (2023)","DOI":"10.1137\/1.9781611977554.ch38"},{"issue":"1","key":"27_CR15","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"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 534\u2013543 (2003)","DOI":"10.1109\/SFCS.2003.1238226"},{"key":"27_CR17","unstructured":"Gupta, A., Tangwongsan, K.: Simpler analyses of local search algorithms for facility location. CoRR abs\/0809.2554 (2008)"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Humayun, A.I., Balestriero, R., Kyrillidis, A., Baraniuk, R.G.: No more than 6ft apart: robust $$k$$-means via radius upper bounds. In: Proceedings of the 48th IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 4433\u20134437 (2022)","DOI":"10.1109\/ICASSP43922.2022.9746288"},{"issue":"6","key":"27_CR19","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":"27_CR20","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 48(2), 274\u2013296 (2001)","journal-title":"J. ACM"},{"key":"27_CR21","unstructured":"Jung, C., Kannan, S., Lutz, N.: Service in your neighborhood: fairness in center location. In: Proceedings of the 1st Symposium on Foundations of Responsible Computing, pp. 5:1\u20135:15 (2020)"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Kazakovtsev, L.A., Stupina, A.A.: Fast genetic algorithm with greedy heuristic for $$p$$-median and $$k$$-means problems. In: Proceedings of the 6th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, pp. 602\u2013606 (2014)","DOI":"10.1109\/ICUMT.2014.7002169"},{"issue":"3","key":"27_CR23","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1137\/S0097539702404055","volume":"37","author":"SG Kolliopoulos","year":"2007","unstructured":"Kolliopoulos, S.G., Rao, S.: A nearly linear-time approximation scheme for the Euclidean $$k$$-median problem. SIAM J. Comput. 37(3), 757\u2013782 (2007)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"27_CR24","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1137\/130938645","volume":"45","author":"S Li","year":"2016","unstructured":"Li, S., Svensson, O.: Approximating $$k$$-median via pseudo-approximation. SIAM J. Comput. 45(2), 530\u2013547 (2016)","journal-title":"SIAM J. Comput."},{"key":"27_CR25","unstructured":"Mahabadi, S., Vakilian, A.: Individual fairness for $$k$$-clustering. In: Proceedings of the 37th International Conference on Machine Learning, pp. 6586\u20136596 (2020)"},{"key":"27_CR26","unstructured":"Manurangsi, P., Raghavendra, P.: A birthday repetition theorem and complexity of approximating dense CSPs. In: Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, pp. 78:1\u201378:15 (2017)"},{"key":"27_CR27","unstructured":"Negahbani, M., Chakrabarty, D.: Better algorithms for individually fair $$k$$-clustering. In: Proceedings of the 34th Advances in Neural Information Processing Systems, pp. 13340\u201313351 (2021)"},{"issue":"1","key":"27_CR28","first-page":"775","volume":"21","author":"A Panteli","year":"2021","unstructured":"Panteli, A., Boutsinas, B., Giannikos, I.: On solving the multiple $$p$$-median problem based on biclustering. Oper. Res. 21(1), 775\u2013799 (2021)","journal-title":"Oper. Res."},{"key":"27_CR29","doi-asserted-by":"crossref","unstructured":"Talwar, K.: Bypassing the embedding: algorithms for low dimensional metrics. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 281\u2013290 (2004)","DOI":"10.1145\/1007352.1007399"},{"key":"27_CR30","unstructured":"Vakilian, A., Yal\u00e7iner, M.: Improved approximation algorithms for individually fair clustering. In: Proceedings of the 25th International Conference on Artificial Intelligence and Statistics, pp. 8758\u20138779 (2022)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-4445-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T09:34:27Z","timestamp":1746437667000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-4445-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819644445","9789819644452"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-4445-2_27","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":"6 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2024","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":"cocoa2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cocoa2024.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}