{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:28:20Z","timestamp":1743121700440,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031221040"},{"type":"electronic","value":"9783031221057"}],"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-22105-7_43","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:36:12Z","timestamp":1672540572000},"page":"488-495","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Schemes for k-Facility Location"],"prefix":"10.1007","author":[{"given":"Xiangyan","family":"Kong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"issue":"2","key":"43_CR1","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.ejor.2014.10.011","volume":"242","author":"K Aardal","year":"2015","unstructured":"Aardal, K., van den Berg, P.L., Gijswijt, D., Li, S.: Approximation algorithms for hard capacitated $$k$$-facility location problems. Eur. J. Oper. Res. 242(2), 358\u2013368 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"43_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-03685-9_2","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A Aggarwal","year":"2009","unstructured":"Aggarwal, A., Deshpande, A., Kannan, R.: Adaptive sampling for k-means clustering. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX\/RANDOM -2009. LNCS, vol. 5687, pp. 15\u201328. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03685-9_2"},{"key":"43_CR3","unstructured":"Arthur, D., Vassilvitskii, S.: $$k$$-means++: the advantages of careful seeding. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1027\u20131035 (2007)"},{"key":"43_CR4","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 (FOCS), pp. 743\u2013754 (2017)","DOI":"10.1109\/FOCS.2017.74"},{"issue":"1","key":"43_CR5","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":"43_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-31594-7_17","volume-title":"Automata, Languages, and Programming","author":"M Charikar","year":"2012","unstructured":"Charikar, M., Li, S.: A dependent LP-rounding approach for the k-median problem. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7391, pp. 194\u2013205. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31594-7_17"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Chen, K.: On $$k$$-median clustering in high dimensions. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1177\u20131185 (2006)","DOI":"10.1145\/1109557.1109687"},{"key":"43_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"},{"issue":"1","key":"43_CR9","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":"43_CR10","unstructured":"Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings. In: Proceedings of the 44th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 534\u2013543 (2003)"},{"issue":"2","key":"43_CR11","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10878-017-0179-0","volume":"35","author":"L Han","year":"2018","unstructured":"Han, L., Xu, D., Du, D., Zhang, D.: A local search approximation algorithm for the uniform capacitated $$k$$-facility location problem. J. Comb. Optimiz. 35(2), 409\u2013423 (2018)","journal-title":"J. Comb. Optimiz."},{"issue":"5","key":"43_CR12","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1137\/S0097539704446281","volume":"35","author":"S Har-Peled","year":"2006","unstructured":"Har-Peled, S., Mendel, M.: Fast construction of nets in low-dimensional metrics and their applications. SIAM J. Comput. 35(5), 1148\u20131184 (2006)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"43_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":"43_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 48(2), 274\u2013296 (2001)","journal-title":"J. ACM"},{"issue":"2","key":"43_CR15","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s10878-017-0192-3","volume":"35","author":"Y Jiang","year":"2018","unstructured":"Jiang, Y., Xu, D., Du, D., Wu, C., Zhang, D.: An approximation algorithm for soft capacitated $$k$$-facility location problem. J. Comb. Optimiz. 35(2), 493\u2013511 (2018)","journal-title":"J. Comb. Optimiz."},{"key":"43_CR16","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)"},{"key":"43_CR17","doi-asserted-by":"crossref","unstructured":"Narayanan, S., Nelson, J.: Optimal terminal dimensionality reduction in Euclidean space. In: Charikar, M., Cohen, E. (eds.) Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 1064\u20131069. ACM (2019)","DOI":"10.1145\/3313276.3316307"},{"issue":"4","key":"43_CR18","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00453-004-1112-3","volume":"40","author":"C Swamy","year":"2004","unstructured":"Swamy, C., Kumar, A.: Primal-dual algorithms for connected facility location problems. Algorithmica 40(4), 245\u2013269 (2004)","journal-title":"Algorithmica"},{"issue":"1","key":"43_CR19","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/s10878-016-0080-2","volume":"36","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Xu, D., Du, D., Wu, C.: An approximation algorithm for $$k$$-facility location problem with linear penalties using local search scheme. J. Comb. Optimiz. 36(1), 264\u2013279 (2018)","journal-title":"J. Comb. Optimiz."},{"key":"43_CR20","unstructured":"Wei, D.: A constant-factor bi-criteria approximation guarantee for $$k$$-means++. In: Proceedings of the 29th Annual Conference on Neural Information Processing Systems (NeurIPS), pp. 604\u2013612 (2016)"},{"key":"43_CR21","doi-asserted-by":"crossref","unstructured":"Xu, Y., Hao, C., Wu, C., Zhang, Y.: On stochastic $$k$$-facility location. In: Proceedings of the 15th International Conference on Algorithmic Aspects in Information and Management (AAIM), pp. 47\u201356 (2021)","DOI":"10.1007\/978-3-030-93176-6_5"},{"issue":"1","key":"43_CR22","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.tcs.2007.05.024","volume":"384","author":"P Zhang","year":"2007","unstructured":"Zhang, P.: A new approximation algorithm for the $$k$$-facility location problem. Theoret. Comput. Sci. 384(1), 126\u2013135 (2007)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22105-7_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T22:06:17Z","timestamp":1680213977000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_43","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":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","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":"101","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":"39","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":"12","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":"39% - 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":"5","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)"}}]}}