{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:02:58Z","timestamp":1742911378459,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491894"},{"type":"electronic","value":"9783031491900"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-49190-0_28","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"384-397","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A PTAS Framework for\u00a0Clustering Problems in\u00a0Doubling Metrics"],"prefix":"10.1007","author":[{"given":"Di","family":"Wu","sequence":"first","affiliation":[]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"28_CR1","unstructured":"Adamczyk, M., Byrka, J., Marcinkowski, J., Meesum, S.M., Wlodarczyk, M.: Constant-factor FPT approximation for capacitated $$k$$-median. In: Proceedings of 27th Annual European Symposium on Algorithms, p. 1 (2019)"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Raghavan, P., Rao, S.: Approximation schemes for Euclidean $$k$$-medians and related problems. In: Proceedings of 30th Annual ACM Symposium on Theory of Computing, pp. 106\u2013113 (1998)","DOI":"10.1145\/276698.276718"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Gottlieb, L.A.: A linear time approximation scheme for Euclidean TSP. In: Proceedings of 54th Annual Symposium on Foundations of Computer Science, pp. 698\u2013706 (2013)","DOI":"10.1109\/FOCS.2013.80"},{"issue":"3","key":"28_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":"28_CR5","unstructured":"Bera, S., Chakrabarty, D., Flores, N., Negahbani, M.: Fair algorithms for clustering. In: Proceedings of 33rd Advances in Neural Information Processing Systems, pp. 4954\u20134965 (2019)"},{"key":"28_CR6","unstructured":"Bercea, I.O., et al.: On the cost of essentially fair clusterings. In: Proceedings of 22nd International Conference on Approximation Algorithms for Combinatorial Optimization Problems and 23rd International Conference on Randomization and Computation, p. 18 (2019)"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Chalermsook, P., et al.: From gap-ETH to FPT-inapproximability: clique, dominating set, and more. In: Proceedings of 58th IEEE Annual Symposium on Foundations of Computer Science, pp. 743\u2013754 (2017)","DOI":"10.1109\/FOCS.2017.74"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guha, S., Tardos, \u00c9., Shmoys, D.B.: A constant-factor approximation algorithm for the $$k$$-median problem. In: Proceedings of 31st Annual ACM Symposium on Theory of Computing, pp. 1\u201310 (1999)","DOI":"10.1145\/301250.301257"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V.: Approximation schemes for capacitated clustering in doubling metrics. In: Proceedings of 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2241\u20132259 (2020)","DOI":"10.1137\/1.9781611975994.138"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V., Esfandiari, H., Mirrokni, V., Narayanan, S.: Improved approximations for Euclidean $$k$$-means and $$k$$-median, via nested quasi-independent sets. In: Proceedings of 54th Annual ACM SIGACT Symposium on Theory of Computing, pp. 1621\u20131628 (2022)","DOI":"10.1145\/3519935.3520011"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V., Feldmann, A.E., Saulpic, D.: Near-linear time approximations schemes for clustering in doubling metrics. In: Proceedings of 60th Annual Symposium on Foundations of Computer Science, pp. 540\u2013559 (2019)","DOI":"10.1109\/FOCS.2019.00041"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V., Grandoni, F., Lee, E., Schwiegelshohn, C.: Breaching the 2 LMP approximation barrier for facility location with applications to $$k$$-median. In: Proceedings of 34th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 940\u2013986 (2023)","DOI":"10.1137\/1.9781611977554.ch37"},{"key":"28_CR13","unstructured":"Cohen-Addad, V., Gupta, A., Kumar, A., Lee, E., Li, J.: Tight FPT approximations for $$k$$-median and $$k$$-means. In: Proceedings of 46th International Colloquium on Automata, Languages, and Programming, pp. 42-1 (2019)"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Current, J., Daskin, M., Schilling, D., et al.: Discrete network location models. In: Facility Location: Applications and Theory, vol. 1, pp. 81\u2013118 (2002)","DOI":"10.1007\/978-3-642-56082-8_3"},{"issue":"4","key":"28_CR15","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1007\/s00453-019-00616-2","volume":"82","author":"H Ding","year":"2020","unstructured":"Ding, H., Xu, J.: A unified framework for clustering constrained data without locality property. Algorithmica 82(4), 808\u2013852 (2020)","journal-title":"Algorithmica"},{"issue":"4","key":"28_CR16","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1007\/s10878-018-0340-4","volume":"37","author":"Q Feng","year":"2019","unstructured":"Feng, Q., Hu, J., Huang, N., Wang, J.: Improved PTAS for the constrained $$k$$-means problem. J. Comb. Optim. 37(4), 1091\u20131110 (2019)","journal-title":"J. Comb. Optim."},{"key":"28_CR17","unstructured":"Feng, Q., Zhang, Z., Huang, Z., Xu, J., Wang, J.: A unified framework of FPT approximation algorithms for clustering problems. In: Proceedings of 31st International Symposium on Algorithms and Computation, pp. 51\u2013517 (2020)"},{"issue":"1","key":"28_CR18","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":"28_CR19","doi-asserted-by":"crossref","unstructured":"Guo, Y., Huang, J., Zhang, Z.: A constant factor approximation for lower-bounded $$k$$-median. In: Proceedings of 16th International Conference Theory and Applications of Models of Computation, pp. 119\u2013131 (2020)","DOI":"10.1007\/978-3-030-59267-7_11"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings. In: Proceedings of 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 534\u2013543 (2003)","DOI":"10.1109\/SFCS.2003.1238226"},{"issue":"3","key":"28_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2854153","volume":"12","author":"M Hajiaghayi","year":"2016","unstructured":"Hajiaghayi, M., Hu, W., Li, J., Li, S., Saha, B.: A constant factor approximation algorithm for fault-tolerant $$k$$-median. ACM Trans. Algorithms 12(3), 1\u201319 (2016)","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"28_CR22","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. Optim. 35(2), 409\u2013423 (2018)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"28_CR23","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/s00453-013-9833-9","volume":"70","author":"R Jaiswal","year":"2014","unstructured":"Jaiswal, R., Kumar, A., Sen, S.: A simple $$D^2$$-sampling based PTAS for $$k$$-means and other clustering problems. Algorithmica 70(1), 22\u201346 (2014)","journal-title":"Algorithmica"},{"issue":"3","key":"28_CR24","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."},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"Kumar, A., Sabharwal, Y.: The priority $$k$$-median problem. In: Proceedings of 27th Foundations of Software Technology and Theoretical Computer Science, pp. 71\u201383 (2007)","DOI":"10.1007\/978-3-540-77050-3_6"},{"key":"28_CR26","unstructured":"Love, R., Morris, J., Wesolowsky, G.: Facilities location: models and methods. Operations Research Series, vol. 7 (1988)"},{"key":"28_CR27","unstructured":"Manurangsi, P., Raghavendra, P.: A birthday repetition theorem and complexity of approximating dense CSPs. In: Proceedings of 44th International Colloquium on Automata, Languages, and Programming, p. 78 (2017)"},{"key":"28_CR28","doi-asserted-by":"crossref","unstructured":"Markarian, C.: Online non-metric facility location with service installation costs. In: ICEIS, pp. 737\u2013743 (2021)","DOI":"10.5220\/0010469207370743"},{"key":"28_CR29","doi-asserted-by":"crossref","unstructured":"Ng, T.E., Zhang, H.: Predicting internet network distance with coordinates-based approaches. In: Proceedings of 21st Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 170\u2013179 (2002)","DOI":"10.1109\/INFCOM.2002.1019258"},{"key":"28_CR30","unstructured":"Shmoys, D.B., Swamy, C., Levi, R.: Facility location with service installation costs. In: Proceedings of 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1088\u20131097 (2004)"},{"issue":"4","key":"28_CR31","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"},{"key":"28_CR32","doi-asserted-by":"crossref","unstructured":"Talwar, K.: Bypassing the embedding: algorithms for low dimensional metrics. In: Proceedings of 36th Annual ACM Symposium on Theory of Computing, pp. 281\u2013290 (2004)","DOI":"10.1145\/1007352.1007399"},{"key":"28_CR33","doi-asserted-by":"crossref","unstructured":"Tenenbaum, J.B., Silva, V.D., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290(5500), 2319\u20132323 (2000)","DOI":"10.1126\/science.290.5500.2319"},{"issue":"5","key":"28_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-020-3066-x","volume":"64","author":"Z Zhang","year":"2021","unstructured":"Zhang, Z., Feng, Q., Xu, J., Wang, J.: An approximation algorithm for $$k$$-median with priorities. Sci. China Inf. Sci. 64(5), 150104 (2021)","journal-title":"Sci. China Inf. Sci."},{"key":"28_CR35","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.tcs.2022.05.014","volume":"923","author":"Z Zhang","year":"2022","unstructured":"Zhang, Z., Zhou, Y., Yu, S.: Better guarantees for $$k$$-median with service installation costs. Theoret. Comput. Sci. 923, 292\u2013303 (2022)","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-49190-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T16:29:44Z","timestamp":1730824184000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49190-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491894","9783031491900"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49190-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 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":"Hawaii, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","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":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","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":"60","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":"41% - 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":"6","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)"}}]}}