{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:05:31Z","timestamp":1743026731284,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926809"},{"type":"electronic","value":"9783030926816"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-92681-6_49","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"629-640","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Parameterized Approximation for Balanced k-Median"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2974-5781","authenticated-orcid":false,"given":"Zhen","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Qilong","family":"Feng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"key":"49_CR1","unstructured":"Adamczyk, M., Byrka, J., Marcinkowski, J., Meesum, S.M., Wlodarczyk, M.: Constant-factor FPT approximation for capacitated $$k$$-median. In: Proceedings of the 27th Annual European Symposium on Algorithms (ESA), pp. 1:1\u20131:14 (2019)"},{"issue":"3","key":"49_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":"49_CR3","doi-asserted-by":"crossref","unstructured":"Aydin, K., Bateni, M., Mirrokni, V.S.: Distributed balanced partitioning via linear embedding. In: Proceedings of the 9th ACM International Conference on Web Search and Data Mining (WSDM), pp. 387\u2013396 (2016)","DOI":"10.1145\/2835776.2835829"},{"key":"49_CR4","unstructured":"Bateni, M., Bhaskara, A., Lattanzi, S., Mirrokni, V.S.: Distributed balanced clustering via mapping coresets. In: Proceedings of the 27th Annual Conference on Neural Information Processing Systems (NeurIPS), pp. 2591\u20132599 (2014)"},{"issue":"2","key":"49_CR5","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.ejor.2017.04.054","volume":"263","author":"S Borgwardt","year":"2017","unstructured":"Borgwardt, S., Brieden, A., Gritzmann, P.: An LP-based $$k$$-means algorithm for balancing weighted point sets. Eur. J. Oper. Res. 263(2), 349\u2013355 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"49_CR6","doi-asserted-by":"crossref","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), 23:1\u201323:31 (2017)","DOI":"10.1145\/2981561"},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"Charikar, M., Li, S.: A dependent LP-rounding approach for the $$k$$-median problem. In: Proceedings of the 39th International Colloquium on Automata, Languages, and Programming (ICALP), pp. 194\u2013205 (2012)","DOI":"10.1007\/978-3-642-31594-7_17"},{"key":"49_CR8","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 (ICALP), pp. 42:1\u201342:14 (2019)"},{"key":"49_CR9","unstructured":"Cohen-Addad, V., Li, J.: On the fixed-parameter tractability of capacitated clustering. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP), pp. 41:1\u201341:14 (2019)"},{"key":"49_CR10","unstructured":"Demirci, H.G., Li, S.: Constant approximation for capacitated $$k$$-median with $$(1+\\epsilon )$$-capacity violation. In: Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP), pp. 73:1\u201373:14 (2016)"},{"key":"49_CR11","unstructured":"Dick, T., Li, M., Pillutla, V.K., White, C., Balcan, N., Smola, A.J.: Data driven resource allocation for distributed learning. In: Proceedings of the 20th International Conference on Artificial Intelligence and Statistics (AISTATS), pp. 662\u2013671 (2017)"},{"key":"49_CR12","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2020.07.022","volume":"842","author":"H Ding","year":"2020","unstructured":"Ding, H.: Faster balanced clusterings in high dimension. Theor. Comput. Sci. 842, 28\u201340 (2020)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"49_CR13","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":"49_CR14","doi-asserted-by":"crossref","unstructured":"Guo, Y., Huang, J., Zhang, Z.: A constant factor approximation for lower-bounded $$k$$-median. In: Proceedings of the 16th International Conference on Theory and Applications of Models of Computation (TAMC), pp. 119\u2013131 (2020)","DOI":"10.1007\/978-3-030-59267-7_11"},{"key":"49_CR15","doi-asserted-by":"crossref","unstructured":"Han, L., Hao, C., Wu, C., Zhang, Z.: Approximation algorithms for the lower-bounded $$k$$-median and its generalizations. In: Proceedings of the 26th International Conference on Computing and Combinatorics (COCOON), pp. 627\u2013639 (2020)","DOI":"10.1007\/978-3-030-58150-3_51"},{"issue":"6","key":"49_CR16","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":"49_CR17","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":"49_CR18","doi-asserted-by":"crossref","unstructured":"Li, S.: Approximating capacitated $$k$$-median with $$(1+\\epsilon )k$$ open facilities. In: Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 786\u2013796 (2016)","DOI":"10.1137\/1.9781611974331.ch56"},{"key":"49_CR19","doi-asserted-by":"crossref","unstructured":"Li, S.: On uniform capacitated $$k$$-median beyond the natural LP relaxation. ACM Trans. Algorithms 13(2), 22:1\u201322:18 (2017)","DOI":"10.1145\/2983633"},{"issue":"2","key":"49_CR20","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":"49_CR21","doi-asserted-by":"crossref","unstructured":"Lin, W., He, Z., Xiao, M.: Balanced clustering: a uniform model and fast algorithm. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI), pp. 2987\u20132993 (2019)","DOI":"10.24963\/ijcai.2019\/414"},{"key":"49_CR22","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 (ICALP), pp. 78:1\u201378:15 (2017)"},{"issue":"3","key":"49_CR23","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1049\/iet-wss.2015.0069","volume":"6","author":"S Siavoshi","year":"2016","unstructured":"Siavoshi, S., Kavian, Y.S., Sharif, H.: Load-balanced energy efficient clustering protocol for wireless sensor networks. IET Wirel. Sens. Syst. 6(3), 67\u201373 (2016)","journal-title":"IET Wirel. Sens. Syst."}],"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-3-030-92681-6_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:09:22Z","timestamp":1639354162000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92681-6_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92681-6_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 December 2021","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":"Tianjin","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":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lxy.tjut.edu.cn\/COCOA2021\/COCOA_2021.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"62","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":"16","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":"8","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":"26% - 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":"4.2","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":"2.75","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)"}}]}}