{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:40:59Z","timestamp":1740109259147,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2017,9,19]],"date-time":"2017-09-19T00:00:00Z","timestamp":1505779200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["FE 560\/6-1"],"award-info":[{"award-number":["FE 560\/6-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"CEDRE","award":["30885TM"],"award-info":[{"award-number":["30885TM"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s00453-017-0374-5","type":"journal-article","created":{"date-parts":[[2017,9,19]],"date-time":"2017-09-19T15:00:26Z","timestamp":1505833226000},"page":"2517-2550","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Clustering with Lower-Bounded Sizes"],"prefix":"10.1007","volume":"80","author":[{"given":"Faisal N.","family":"Abu-Khzam","sequence":"first","affiliation":[]},{"given":"Cristina","family":"Bazgan","sequence":"additional","affiliation":[]},{"given":"Katrin","family":"Casel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4444-3220","authenticated-orcid":false,"given":"Henning","family":"Fernau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,19]]},"reference":[{"key":"374_CR1","unstructured":"Abu-Khzam, F.N., Bazgan, C., Casel, K., Fernau, H.: Building clusters with lower-bounded sizes. In: Hong, S. (ed.) 27th International Symposium on Algorithms and Computation, ISAAC, LIPIcs, vol. 64, pp. 4:1\u20134:13. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"issue":"3","key":"374_CR2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/1798596.1798602","volume":"6","author":"G Aggarwal","year":"2010","unstructured":"Aggarwal, G., Panigrahy, R., Feder, T., Thomas, D., Kenthapadi, K., Khuller, S., Zhu, A.: Achieving anonymity via clustering. ACM Trans. Algorithms 6(3), 49 (2010)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"374_CR3","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1137\/090752699","volume":"40","author":"E Anshelevich","year":"2011","unstructured":"Anshelevich, E., Karagiozova, A.: Terminal backup, 3D matching, and covering cubic graphs. SIAM J. Comput. 40(3), 678\u2013708 (2011)","journal-title":"SIAM J. Comput."},{"issue":"7","key":"374_CR4","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1016\/j.tcs.2010.04.040","volume":"412","author":"A Armon","year":"2011","unstructured":"Armon, A.: On min\u2013max $$r$$ r -gatherings. Theor. Comput. Sci. 412(7), 573\u2013582 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"374_CR5","doi-asserted-by":"crossref","unstructured":"Blocki, J., Williams, R.: Resolving the complexity of some data privacy problems. In: Abramsky, S., Gavoille, C., Kirchner, C., auf der Heide, F.M., Spirakis, P.G. (eds.) Proceedings of the 37th International Colloquium Conference on Automata, Languages and Programming, ICALP\u201910: Part II, LNCS, vol. 6199, pp. 393\u2013404. Springer (2010)","DOI":"10.1007\/978-3-642-14162-1_33"},{"key":"374_CR6","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/978-3-540-71703-4_18","volume-title":"Advances in Databases: Concepts, Systems and Applications, LNCS","author":"JW Byun","year":"2007","unstructured":"Byun, J.W., Kamra, A., Bertino, E., Li, N.: Efficient $$k$$ k -anonymization using clustering techniques. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds.) Advances in Databases: Concepts, Systems and Applications, LNCS, vol. 4443, pp. 188\u2013200. Springer, Berlin (2007)"},{"issue":"4","key":"374_CR7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0167-6377(82)90016-5","volume":"1","author":"G Cornu\u00e9jols","year":"1982","unstructured":"Cornu\u00e9jols, G., Hartvigsen, D., Pulleyblank, W.: Packing subgraphs in a graph. Oper. Res. Lett. 1(4), 139\u2013143 (1982)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"374_CR8","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1109\/69.979982","volume":"14","author":"J Domingo-Ferrer","year":"2002","unstructured":"Domingo-Ferrer, J., Mateo-Sanz, J.M.: Practical data-oriented microaggregation for statistical disclosure control. IEEE Trans. Knowl. Data Eng. 14(1), 189\u2013201 (2002)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"374_CR9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/11930242_12","volume-title":"Privacy in Statistical Databases, PSD\u201906, LNCS","author":"J Domingo-Ferrer","year":"2006","unstructured":"Domingo-Ferrer, J., Seb\u00e9, F.: Optimal multivariate 2-microaggregation for microdata protection: a 2-approximation. In: Domingo-Ferrer, J., Franconi, L. (eds.) Privacy in Statistical Databases, PSD\u201906, LNCS, vol. 4302, pp. 129\u2013138. Springer, Berlin (2006)"},{"key":"374_CR10","doi-asserted-by":"crossref","first-page":"88124","DOI":"10.1007\/BF01580113","volume":"5","author":"J Edmonds","year":"1973","unstructured":"Edmonds, J., Johnson, E.L.: Matching, Euler tours and the Chinese postman. Math. Program. 5, 88124 (1973)","journal-title":"Math. Program."},{"key":"374_CR11","doi-asserted-by":"crossref","unstructured":"Erg\u00fcn, F., Kumar, R., Rubinfeld, R.: Fast approximate PCPs. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1\u20134 May 1999, Atlanta, Georgia, USA, pp. 41\u201350 (1999)","DOI":"10.1145\/301250.301267"},{"issue":"2","key":"374_CR12","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.: A general approximation technique for constrained forest problems. SIAM J. Comput. 24(2), 296\u2013317 (1995)","journal-title":"SIAM J. Comput."},{"key":"374_CR13","doi-asserted-by":"crossref","unstructured":"Guha, S., Meyerson, A., Munagala, K.: Hierarchical placement and network design problems. In: In Proceedings of the 41th Annual IEEE Symposium on Foundations of Computer Science, FOCS\u201900, pp. 603\u2013612. IEEE Computer Society (2000)","DOI":"10.1109\/SFCS.2000.892328"},{"issue":"3","key":"374_CR14","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1006\/jagm.1994.1044","volume":"17","author":"V King","year":"1994","unstructured":"King, V., Rao, S., Tarjan, R.: A faster deterministic maximum flow algorithm. J. Algorithms 17(3), 447\u2013474 (1994)","journal-title":"J. Algorithms"},{"key":"374_CR15","doi-asserted-by":"crossref","unstructured":"Orlin, J.B.: Max flows in $$O(nm)$$ O ( n m ) time, or better. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, STOC, pp. 765\u2013774. ACM (2013)","DOI":"10.1145\/2488608.2488705"},{"key":"374_CR16","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43, 425\u2013440 (1991)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"374_CR17","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.1109\/69.971193","volume":"13","author":"P Samarati","year":"2001","unstructured":"Samarati, P.: Protecting respondents\u2019 identities in microdata release. IEEE Trans. Knowl. Data Eng. 13(6), 1010\u20131027 (2001)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"374_CR18","volume-title":"Combinatorial Optimization","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Springer, Berlin (2003)"},{"issue":"2","key":"374_CR19","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/1721837.1721850","volume":"6","author":"A Shalita","year":"2010","unstructured":"Shalita, A., Zwick, U.: Efficient algorithms for the 2-gathering problem. ACM Trans. Algorithms 6(2), 34 (2010)","journal-title":"ACM Trans. Algorithms"},{"key":"374_CR20","doi-asserted-by":"crossref","unstructured":"Stokes, K.: On computational anonymity. In: Privacy in Statistical Databases\u2014UNESCO Chair in Data Privacy, International Conference, PSD 2012, Palermo, Italy, 26\u201328 September 2012. Proceedings, pp. 336\u2013347 (2012)","DOI":"10.1007\/978-3-642-33627-0_26"},{"issue":"1","key":"374_CR21","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"C Tovey","year":"1984","unstructured":"Tovey, C.: A simplified NP-complete satisfiability problem. Discrete Appl. Math. 8(1), 85\u201389 (1984)","journal-title":"Discrete Appl. Math."},{"key":"374_CR22","doi-asserted-by":"crossref","unstructured":"Xu, D., Anshelevich, E., Chiang, M.: On survivable access network design: complexity and algorithms. In: INFOCOM 2008. 27th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 13\u201318 April 2008, Phoenix, AZ, USA, pp. 186\u2013190 (2008)","DOI":"10.1109\/INFOCOM.2008.46"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0374-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0374-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0374-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,17]],"date-time":"2020-10-17T22:51:54Z","timestamp":1602975114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0374-5"}},"subtitle":["A General Graph-Theoretic Framework"],"short-title":[],"issued":{"date-parts":[[2017,9,19]]},"references-count":22,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["374"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0374-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2017,9,19]]}}}