{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:51:22Z","timestamp":1743072682029,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030835071"},{"type":"electronic","value":"9783030835088"}],"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-83508-8_28","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"385-398","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parameterized Complexity of Categorical Clustering with Size Constraints"],"prefix":"10.1007","author":[{"given":"Fedor V.","family":"Fomin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr A.","family":"Golovach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nidhi","family":"Purohit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"issue":"3","key":"28_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1798596.1798602","volume":"6","author":"G Aggarwal","year":"2010","unstructured":"Aggarwal, G., et al.: Achieving anonymity via clustering. ACM Trans. Algorithms 6(3), 1\u201319 (2010)","journal-title":"ACM Trans. Algorithms"},{"issue":"4","key":"28_CR2","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844\u2013856 (1995). https:\/\/doi.org\/10.1145\/210332.210337","journal-title":"J. ACM"},{"key":"28_CR3","volume-title":"Modern Information Retrieval","author":"R Baeza-Yates","year":"1999","unstructured":"Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval, vol. 463. ACM Press, New York (1999)"},{"key":"28_CR4","doi-asserted-by":"publisher","unstructured":"Ban, F., Bhattiprolu, V., Bringmann, K., Kolev, P., Lee, E., Woodruff, D.P.: A PTAS for $$\\ell _p$$-low rank approximation. In: 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, pp. 747\u2013766. SIAM (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.47","DOI":"10.1137\/1.9781611975482.47"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Banerjee, A., Ghosh, J.: Clustering with balancing constraints. In: Constrained Clustering: Advances in Algorithms, Theory, and Applications, pp. 171\u2013200. CRC Press (2008)","DOI":"10.1201\/9781584889977.ch8"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Byrka, J., Fleszar, K., Rybicki, B., Spoerhase, J.: Bi-factor approximation algorithms for hard capacitated k-median problems. In: 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, pp. 722\u2013736. SIAM (2015)","DOI":"10.1137\/1.9781611973730.49"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-319-33461-5_22","volume-title":"Integer Programming and Combinatorial Optimization","author":"J Byrka","year":"2016","unstructured":"Byrka, J., Rybicki, B., Uniyal, S.: An approximation algorithm for uniform capacitated k-median problem with $$1+\\epsilon $$ capacity violation. In: Louveaux, Q., Skutella, M. (eds.) IPCO 2016. LNCS, vol. 9682, pp. 262\u2013274. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-33461-5_22"},{"issue":"1","key":"28_CR8","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."},{"issue":"1","key":"28_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00453-015-0010-1","volume":"75","author":"DZ Chen","year":"2016","unstructured":"Chen, D.Z., Li, J., Liang, H., Wang, H.: Matroid and knapsack center problems. Algorithmica 75(1), 27\u201352 (2016). https:\/\/doi.org\/10.1007\/s00453-015-0010-1","journal-title":"Algorithmica"},{"key":"28_CR10","unstructured":"Chuzhoy, J., Rabani, Y.: Approximating k-median with non-uniform capacities. In: 16th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 952\u2013958. SIAM (2005)"},{"issue":"1","key":"28_CR11","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s00453-007-0029-z","volume":"49","author":"R Cilibrasi","year":"2007","unstructured":"Cilibrasi, R., van Iersel, L., Kelk, S., Tromp, J.: The complexity of the single individual SNP haplotyping problem. Algorithmica 49(1), 13\u201336 (2007). https:\/\/doi.org\/10.1007\/s00453-007-0029-z","journal-title":"Algorithmica"},{"key":"28_CR12","unstructured":"Cohen-Addad, V., Li, J.: On the fixed-parameter tractability of capacitated clustering. In: 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. LIPIcs, vol. 132, pp. 41:1\u201341:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"28_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"28_CR14","unstructured":"Demirci, H.G., Li, S.: Constant approximation for capacitated $$k$$-median with $$(1+\\varepsilon )$$-capacity violation. In: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016. LIPIcs, vol. 55, pp. 73:1\u201373:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"key":"28_CR15","unstructured":"Feige, U.: NP-hardness of hypercube 2-segmentation. CoRR abs\/1411.0821 (2014). http:\/\/arxiv.org\/abs\/1411.0821"},{"key":"28_CR16","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Golovach, P.A., Lokshtanov, D., Panolan, F., Saurabh, S.: Approximation schemes for low-rank binary matrix approximation problems. ACM Trans. Algorithms 16(1), 12:1\u201312:39 (2020). https:\/\/doi.org\/10.1145\/3365653","DOI":"10.1145\/3365653"},{"issue":"2","key":"28_CR17","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/s10618-019-00669-5","volume":"34","author":"FV Fomin","year":"2020","unstructured":"Fomin, F.V., Golovach, P.A., Panolan, F.: Parameterized low-rank binary matrix approximation. Data Min. Knowl. Discov. 34(2), 478\u2013532 (2020). https:\/\/doi.org\/10.1007\/s10618-019-00669-5","journal-title":"Data Min. Knowl. Discov."},{"key":"28_CR18","unstructured":"Fomin, F.V., Golovach, P.A., Purohit, N.: Parameterized complexity of categorical clustering with size constraints. CoRR 2104.07974 (2021). https:\/\/arxiv.org\/abs\/2104.07974"},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.jcss.2020.10.005","volume":"117","author":"FV Fomin","year":"2021","unstructured":"Fomin, F.V., Golovach, P.A., Simonov, K.: Parameterized k-clustering: tractability island. J. Comput. Syst. Sci. 117, 50\u201374 (2021). https:\/\/doi.org\/10.1016\/j.jcss.2020.10.005","journal-title":"J. Comput. Syst. Sci."},{"key":"28_CR20","volume-title":"Kernelization: Theory of Parameterized Preprocessing","author":"FV Fomin","year":"2019","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Zehavi, M.: Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press, Cambridge (2019)"},{"issue":"7","key":"28_CR21","doi-asserted-by":"publisher","first-page":"258","DOI":"10.3390\/s20700258","volume":"2","author":"S Ghiasi","year":"2002","unstructured":"Ghiasi, S., Srivastava, A., Yang, X., Sarrafzadeh, M.: Optimal energy aware clustering in sensor networks. Sensors 2(7), 258\u2013269 (2002)","journal-title":"Sensors"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Gupta, G., Younis, M.: Load-balanced clustering of wireless sensor networks. In: IEEE International Conference on Communications (ICC), vol. 3, pp. 1848\u20131852. IEEE (2003)","DOI":"10.1109\/ICC.2003.1203919"},{"issue":"2","key":"28_CR23","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1145\/972639.972644","volume":"51","author":"J Kleinberg","year":"2004","unstructured":"Kleinberg, J., Papadimitriou, C., Raghavan, P.: Segmentation problems. J. ACM 51(2), 263\u2013280 (2004). https:\/\/doi.org\/10.1145\/972639.972644","journal-title":"J. ACM"},{"key":"28_CR24","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"},{"key":"28_CR25","unstructured":"Lynch, P.J., Horton, S., Horton, S.: Web Style Guide: Basic Design Principles for Creating Web Sites. Universities Press (1999)"},{"key":"28_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-662-44415-3_4","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"MI Malinen","year":"2014","unstructured":"Malinen, M.I., Fr\u00e4nti, P.: Balanced K-means for clustering. In: Fr\u00e4nti, P., Brown, G., Loog, M., Escolano, F., Pelillo, M. (eds.) S+SSPR 2014. LNCS, vol. 8621, pp. 32\u201341. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44415-3_4"},{"issue":"4","key":"28_CR27","doi-asserted-by":"publisher","first-page":"1382","DOI":"10.1137\/060673898","volume":"38","author":"D Marx","year":"2008","unstructured":"Marx, D.: Closest substring problems with small distances. SIAM J. Comput. 38(4), 1382\u20131410 (2008). https:\/\/doi.org\/10.1137\/060673898","journal-title":"SIAM J. Comput."},{"issue":"10","key":"28_CR28","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1109\/TKDE.2008.53","volume":"20","author":"P Miettinen","year":"2008","unstructured":"Miettinen, P., Mielik\u00e4inen, T., Gionis, A., Das, G., Mannila, H.: The discrete basis problem. IEEE Trans. Knowl. Data Eng. 20(10), 1348\u20131362 (2008). https:\/\/doi.org\/10.1109\/TKDE.2008.53","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"28_CR29","unstructured":"Nielsen, A.: Category management: positioning your organization to win, Chicago (1992)"},{"issue":"2","key":"28_CR30","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1145\/506147.506149","volume":"49","author":"R Ostrovsky","year":"2002","unstructured":"Ostrovsky, R., Rabani, Y.: Polynomial-time approximation schemes for geometric min-sum median clustering. J. ACM 49(2), 139\u2013156 (2002). https:\/\/doi.org\/10.1145\/506147.506149","journal-title":"J. ACM"},{"issue":"3","key":"28_CR31","doi-asserted-by":"publisher","first-page":"583","DOI":"10.2307\/1969046","volume":"49","author":"R Otter","year":"1948","unstructured":"Otter, R.: The number of trees. Ann. Math. 49(3), 583\u2013599 (1948). https:\/\/doi.org\/10.2307\/1969046","journal-title":"Ann. Math."},{"key":"28_CR32","unstructured":"R\u00f6sner, C., Schmidt, M.: Privacy preserving clustering with constraints. In: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). LIPIcs, vol. 107, pp. 96:1\u201396:14. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"28_CR33","doi-asserted-by":"publisher","unstructured":"Vallejo-Huanga, D., Morillo, P., Ferri, C.: Semi-supervised clustering algorithms for grouping scientific articles. In: International Conference on Computational Science (ICCS) (2017). Procedia Comput. Sci. 108, 325\u2013334. https:\/\/doi.org\/10.1016\/j.procs.2017.05.206","DOI":"10.1016\/j.procs.2017.05.206"},{"issue":"2","key":"28_CR34","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/0215039","volume":"15","author":"RA Wright","year":"1986","unstructured":"Wright, R.A., Richmond, L.B., Odlyzko, A.M., McKay, B.D.: Constant time generation of free trees. SIAM J. Comput. 15(2), 540\u2013548 (1986). https:\/\/doi.org\/10.1137\/0215039","journal-title":"SIAM J. Comput."},{"key":"28_CR35","unstructured":"Yang, Y., Padmanabhan, B.: Segmenting customer transactions using a pattern-based clustering approach. In: Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM), pp. 411\u2013418. IEEE Computer Society (2003). https:\/\/ieeexplore.ieee.org\/xpl\/conhome\/8854\/proceeding"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:10:23Z","timestamp":1725541823000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_28","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":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","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":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"123","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":"47","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":"38% - 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.1","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":"13","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)"}}]}}