{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:32:35Z","timestamp":1742923955195,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819777518"},{"type":"electronic","value":"9789819777525"}],"license":[{"start":{"date-parts":[[2024,12,29]],"date-time":"2024-12-29T00:00:00Z","timestamp":1735430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,29]],"date-time":"2024-12-29T00:00:00Z","timestamp":1735430400000},"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-97-7752-5_2","type":"book-chapter","created":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T10:05:01Z","timestamp":1735380301000},"page":"21-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Clustering with\u00a0a\u00a0Knapsack Constraint: Parameterized Approximation Algorithms for\u00a0the\u00a0Knapsack Median Problem"],"prefix":"10.1007","author":[{"given":"Zhen","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Limei","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yao","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Qilong","family":"Feng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,29]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Lin, J., Vitter, J.S.: $$\\varepsilon $$-approximations with minimum packing constraint violation. In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing (STOC), pp. 771\u2013782 (1992)","DOI":"10.1145\/129712.129787"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Krishnaswamy, R., Kumar, A., Nagarajan, V., Sabharwal, Y., Saha, B.: The matroid median problem. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1117\u20131130 (2011)","DOI":"10.1137\/1.9781611973082.84"},{"issue":"4","key":"2_CR3","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1137\/S0097539701398594","volume":"34","author":"M Charikar","year":"2005","unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithms for facility location problems. SIAM J. Comput. 34(4), 803\u2013824 (2005)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"2_CR4","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1007\/s00453-017-0294-4","volume":"80","author":"J Byrka","year":"2018","unstructured":"Byrka, J., Pensyl, T.W., Rybicki, B., Spoerhase, J., Srinivasan, A., Trinh, K.: An improved approximation algorithm for knapsack median using sparsification. Algorithmica 80(4), 1093\u20131114 (2018)","journal-title":"Algorithmica"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Kumar, A.: Constant factor approximation algorithm for the knapsack median problem. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 824\u2013832 (2012)","DOI":"10.1137\/1.9781611973099.66"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Swamy, C.: Improved approximation algorithms for matroid and knapsack median problems and applications. ACM Trans. Algorithms 12(4), 49:1-49:22 (2016)","DOI":"10.1145\/2963170"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Han, L., Hao, C., Wu, C., Zhang, Z.: Approximation algorithms for the lower-bounded knapsack median problem. In: Proceedings of the 14th International Conference on Algorithmic Aspects in Information and Management (AAIM), pp. 119\u2013130 (2020)","DOI":"10.1007\/978-3-030-57602-8_11"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Krishnaswamy, R., Li, S., Sandeep, S.: Constant approximation for $$k$$-median and $$k$$-means with outliers via iterative rounding. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 646\u2013659 (2018)","DOI":"10.1145\/3188745.3188882"},{"key":"2_CR9","unstructured":"Gupta, A., Moseley, B., Zhou, R.: Structural iterative rounding for generalized $$k$$-median problems. In: Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP), pp. 77:1\u201377:18 (2021)"},{"key":"2_CR10","unstructured":"Grover, S., Gupta, N., Khuller, S., Pancholi, A.: Constant factor approximation algorithm for uniform hard capacitated knapsack median problem. In: Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp. 23:1\u201323:22 (2018)"},{"issue":"1","key":"2_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"},{"key":"2_CR12","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":"2_CR13","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)"},{"key":"2_CR14","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":"2_CR15","unstructured":"Inamdar, T., Varadarajan, K.R.: Capacitated sum-of-radii clustering: an FPT approximation. In: Proceedings of the 28th Annual European Symposium on Algorithms (ESA), pp. 62:1\u201362:17 (2020)"},{"key":"2_CR16","unstructured":"Bandyapadhyay, S., Lochet, W., Saurabh, S.: FPT constant-approximations for capacitated clustering to minimize the sum of cluster radii. In: Proceedings of the 39th International Symposium on Computational Geometry (SoCG), pp. 12:1\u201312:14 (2023)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Kumar, A., Sabharwal, Y., Sen, S.: Linear-time approximation schemes for clustering problems in any dimensions. J. ACM 57(2), 5:1-5:32 (2010)","DOI":"10.1145\/1667053.1667054"},{"key":"2_CR18","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"},{"issue":"1","key":"2_CR19","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":"5","key":"2_CR20","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."},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Mahabadi, S., Makarychev, K., Makarychev, Y., Razenshteyn, I.P.: Nonlinear dimension reduction via outer Bi-Lipschitz extensions. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 1088\u20131101 (2018)","DOI":"10.1145\/3188745.3188828"}],"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-97-7752-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T20:23:49Z","timestamp":1739305429000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7752-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,29]]},"ISBN":["9789819777518","9789819777525"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7752-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,29]]},"assertion":[{"value":"29 December 2024","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":"Hong Kong","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":"29 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijtcs2024.comp.polyu.edu.hk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}