{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T14:35:03Z","timestamp":1675866903438},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,2,7]],"date-time":"2014-02-07T00:00:00Z","timestamp":1391731200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s00453-014-9874-8","type":"journal-article","created":{"date-parts":[[2014,2,6]],"date-time":"2014-02-06T11:47:35Z","timestamp":1391687255000},"page":"818-835","source":"Crossref","is-referenced-by-count":3,"title":["Parameterized Algorithms for the 2-Clustering Problem with Minimum Sum and Minimum Sum of Squares Objective Functions"],"prefix":"10.1007","volume":"72","author":[{"given":"Bang Ye","family":"Wu","sequence":"first","affiliation":[]},{"given":"Li-Hsuan","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,2,7]]},"reference":[{"issue":"5","key":"9874_CR1","doi-asserted-by":"crossref","first-page":"23:1","DOI":"10.1145\/1411509.1411513","volume":"55","author":"N. Ailon","year":"2008","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. J. ACM 55(5), 23:1\u201323:27 (2008)","journal-title":"J. ACM"},{"key":"9874_CR2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N. Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56, 89\u2013113 (2004)","journal-title":"Mach. Learn."},{"issue":"14","key":"9874_CR3","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1016\/j.ipl.2011.05.003","volume":"111","author":"S. B\u00f6cker","year":"2011","unstructured":"B\u00f6cker, S., Damaschke, P.: Even faster parameterized cluster deletion and cluster editing. Inf. Process. Lett. 111(14), 717\u2013721 (2011)","journal-title":"Inf. Process. Lett."},{"issue":"52","key":"9874_CR4","doi-asserted-by":"crossref","first-page":"5467","DOI":"10.1016\/j.tcs.2009.05.006","volume":"410","author":"S. B\u00f6cker","year":"2009","unstructured":"B\u00f6cker, S., Briesemeister, S., Bui, Q., Truss, A.: Going weighted: parameterized algorithms for cluster editing. Theor. Comput. Sci. 410(52), 5467\u20135480 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"9874_CR5","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1016\/j.jcss.2007.06.024","volume":"74","author":"P. Bonizzoni","year":"2008","unstructured":"Bonizzoni, P., Vedova, G.D., Dondi, R., Jiang, T.: On the approximation of correlation clustering and consensus clustering. J. Comput. Syst. Sci. 74(5), 671\u2013696 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"9874_CR6","volume-title":"Eleventh Italian Conference on Theoretical Computer Science","author":"P. Bonizzoni","year":"2009","unstructured":"Bonizzoni, P., Vedova, G.D., Dondi, R.: A PTAS for the minimum consensus clustering problem with a fixed number of clusters. In: Eleventh Italian Conference on Theoretical Computer Science (2009)"},{"issue":"3","key":"9874_CR7","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/j.jcss.2004.10.012","volume":"71","author":"M. Charikar","year":"2005","unstructured":"Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. J. Comput. Syst. Sci. 71(3), 360\u2013383 (2005)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"9874_CR8","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.jcss.2011.04.001","volume":"78","author":"J. Chen","year":"2012","unstructured":"Chen, J., Meng, J.: A 2k kernel for the cluster editing problem. J. Comput. Syst. Sci. 78(1), 211\u2013220 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"9874_CR9","first-page":"1109","volume":"29","author":"L.H. Chen","year":"2013","unstructured":"Chen, L.H., Chang, M.S., Wang, C.C., Wu, B.Y.: On the min-max 2-cluster editing problem. J. Inf. Sci. Eng. 29(6), 1109\u20131120 (2013)","journal-title":"J. Inf. Sci. Eng."},{"key":"9874_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/978-3-642-11269-0_8","volume-title":"Parameterized and Exact Computation","author":"P. Damaschke","year":"2009","unstructured":"Damaschke, P.: Bounded-degree techniques accelerate some parameterized graph algorithms. In: Chen, J., Fomin, F. (eds.) Parameterized and Exact Computation. Lecture Notes in Computer Science, vol. 5917, pp. 98\u2013109. Springer, Berlin (2009)"},{"key":"9874_CR11","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s00224-008-9130-1","volume":"46","author":"P. Damaschke","year":"2010","unstructured":"Damaschke, P.: Fixed-parameter enumerability of cluster editing and related problems. Theory Comput. Syst. 46, 261\u2013283 (2010)","journal-title":"Theory Comput. Syst."},{"key":"9874_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Berlin (1999)"},{"issue":"1","key":"9874_CR13","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.disopt.2010.09.006","volume":"8","author":"M.R. Fellows","year":"2011","unstructured":"Fellows, M.R., Guo, J., Komusiewicz, C., Niedermeier, R., Uhlmann, J.: Graph-based data clustering with overlaps. Discrete Optim. 8(1), 2\u201317 (2011)","journal-title":"Discrete Optim."},{"issue":"04","key":"9874_CR14","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1142\/S0218213004001867","volume":"13","author":"V. Filkov","year":"2004","unstructured":"Filkov, V., Skiena, S.: Integrating microarray data by consensus clustering. Int. J. Artif. Intell. Tools 13(04), 863\u2013880 (2004)","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"9874_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms","author":"F.V. Fomin","year":"2010","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Springer, Berlin (2010)"},{"key":"9874_CR16","first-page":"32","volume-title":"30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Leibniz International Proceedings in Informatics (LIPIcs)","author":"F.V. Fomin","year":"2013","unstructured":"Fomin, F.V., Kratsch, S., Pilipczuk, M., Pilipczuk, M., Villanger, Y.: Tight bounds for parameterized complexity of cluster editing. In: Portier, N., Wilke, T. (eds.) 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Leibniz International Proceedings in Informatics (LIPIcs), vol. 20, pp. 32\u201343. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl (2013)"},{"issue":"13","key":"9874_CR17","doi-asserted-by":"crossref","first-page":"249","DOI":"10.4086\/toc.2006.v002a013","volume":"2","author":"I. Giotis","year":"2006","unstructured":"Giotis, I., Guruswami, V.: Correlation clustering with a fixed number of clusters. Theory Comput. 2(13), 249\u2013266 (2006)","journal-title":"Theory Comput."},{"key":"9874_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/3-540-44849-7_17","volume-title":"Algorithms and Complexity","author":"J. Gramm","year":"2003","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Graph-modeled data clustering: fixed-parameter algorithms for clique generation. In: Petreschi, R., Persiano, G., Silvestri, R. (eds.) Algorithms and Complexity. Lecture Notes in Computer Science, vol. 2653, pp. 108\u2013119. Springer, Berlin (2003)"},{"key":"9874_CR19","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s00453-004-1090-5","volume":"39","author":"J. Gramm","year":"2004","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Automated generation of search tree algorithms for hard graph modification problems. Algorithmica 39, 321\u2013347 (2004)","journal-title":"Algorithmica"},{"issue":"8\u201310","key":"9874_CR20","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1016\/j.tcs.2008.10.021","volume":"410","author":"J. Guo","year":"2009","unstructured":"Guo, J.: A more effective linear kernelization for cluster editing. Theor. Comput. Sci. 410(8\u201310), 718\u2013726 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9874_CR21","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1307\/mmj\/1028989917","volume":"2","author":"F. Harary","year":"1953","unstructured":"Harary, F.: On the notion of balance of a signed graph. Mich. Math. J. 2(2), 143\u2013146 (1953)","journal-title":"Mich. Math. J."},{"key":"9874_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/978-3-540-72845-0_23","volume-title":"Experimental Algorithms","author":"F. H\u00fcffner","year":"2007","unstructured":"H\u00fcffner, F., Betzler, N., Niedermeier, R.: Optimal edge deletions for signed graph balancing. In: Demetrescu, C. (ed.) Experimental Algorithms. Lecture Notes in Computer Science, vol. 4525, pp. 297\u2013310. Springer, Berlin (2007)"},{"key":"9874_CR23","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/s00224-008-9150-x","volume":"47","author":"F. H\u00fcffner","year":"2010","unstructured":"H\u00fcffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. Theory Comput. Syst. 47, 196\u2013217 (2010)","journal-title":"Theory Comput. Syst."},{"issue":"15","key":"9874_CR24","doi-asserted-by":"crossref","first-page":"2259","DOI":"10.1016\/j.dam.2012.05.019","volume":"160","author":"C. Komusiewicz","year":"2012","unstructured":"Komusiewicz, C., Uhlmann, J.: Cluster editing with locally bounded modifications. Discrete Appl. Math. 160(15), 2259\u20132270 (2012)","journal-title":"Discrete Appl. Math."},{"issue":"3\u20134","key":"9874_CR25","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0020-0190(00)00004-1","volume":"73","author":"R. Niedermeier","year":"2000","unstructured":"Niedermeier, R., Rossmanith, P.: A general method to speed up fixed-parameter-tractable algorithms. Inf. Process. Lett. 73(3\u20134), 125\u2013129 (2000)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20132","key":"9874_CR26","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.dam.2004.01.007","volume":"144","author":"R. Shamir","year":"2004","unstructured":"Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Appl. Math. 144(1\u20132), 173\u2013182 (2004)","journal-title":"Discrete Appl. Math."},{"key":"9874_CR27","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis: Methods and Applications","author":"S. Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications vol. 8. Cambridge University Press, Cambridge (1994)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9874-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-014-9874-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9874-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:13Z","timestamp":1559123113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-014-9874-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,7]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9874"],"URL":"https:\/\/doi.org\/10.1007\/s00453-014-9874-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,7]]}}}