{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:51:43Z","timestamp":1725745903411},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403156"},{"type":"electronic","value":"9783642403163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40316-3_18","type":"book-chapter","created":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T21:53:14Z","timestamp":1377208394000},"page":"201-213","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Clustering of Cabinets at FttCab"],"prefix":"10.1007","author":[{"given":"Frank","family":"Phillipson","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Chardy, M., Costa, M.C., Faye, A., Trampont, M.: Optimizing splitter and ber location in a multilevel optical ftth network. European Journal of Operational Research\u00a0(222), 430\u2013440 (2012)","DOI":"10.1016\/j.ejor.2012.05.024"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Kalsch, M.T., Koerkel, M.F., Nitsch, R.: Embedding ring structures in large ber networks. In: XVth International Telecommunications Network Strategy and Planning Symposium (NETWORKS) (2012)","DOI":"10.1109\/NETWKS.2012.6381715"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-21527-8_8","volume-title":"Network Optimization","author":"S. Gollowitzer","year":"2011","unstructured":"Gollowitzer, S., Gouveia, L., Ljubi\u0107, I.: A node splitting technique for two level network design problems with transition nodes. In: Pahl, J., Reiners, T., Vo\u00df, S. (eds.) INOC 2011. LNCS, vol.\u00a06701, pp. 57\u201370. Springer, Heidelberg (2011)"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.cor.2010.07.002","volume":"38","author":"S. Gollowitzer","year":"2011","unstructured":"Gollowitzer, S., Ljubi\u0107, I.: Mip models for connected facility location: A theoretical and computational study. Computers and Operations Research\u00a038, 435\u2013449 (2011)","journal-title":"Computers and Operations Research"},{"issue":"3","key":"18_CR5","first-page":"149","volume":"2","author":"G.R. Mateus","year":"1994","unstructured":"Mateus, G.R., Cruz, F.R.B., Luna, H.P.L.: An algorithm for hierarchical network design. Location Science\u00a02(3), 149\u2013164 (1994)","journal-title":"Location Science"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Mitcsenkov, A., Paksy, G., Cinkler, T.: Topology design and capex estimation for passive optical networks. In: Proceedings of BROADNETS 2009 (2009)","DOI":"10.4108\/ICST.BROADNETS2009.7245"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00288961","volume":"14","author":"L. Kou","year":"1981","unstructured":"Kou, L., Markowsky, G., Berman, L.: A fast algorithm for steiner trees. Acta Informatica\u00a014, 141\u2013145 (1981)","journal-title":"Acta Informatica"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Zhao, R., Liu, H., Lehnert, R.: Topology design of hierarchical hybrid ber-vdsl access networks with aco. In: Proceedings of Fourth Advanced International Conference on Telecommunications (2008)","DOI":"10.1109\/AICT.2008.60"},{"issue":"1","key":"18_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0305-0548(03)00202-8","volume":"32","author":"I. G\u00f3dor","year":"2005","unstructured":"G\u00f3dor, I., Magyar, G.: Cost-optimal topology planning of hierarchical access networks. Computers & Operations Research\u00a032(1), 59\u201386 (2005)","journal-title":"Computers & Operations Research"},{"key":"18_CR10","unstructured":"MacQueen, J.: Some methods for classi cation and analysis of multivariate observations. In: Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability, pp. 281\u2013297 (1967)"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"A.K. Jain","year":"2010","unstructured":"Jain, A.K.: Data clustering: 50 years beyond k-means. Pattern Recognition Letters\u00a031, 651\u2013666 (2010)","journal-title":"Pattern Recognition Letters"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10994-009-5103-0","volume":"75","author":"D. Aloise","year":"2009","unstructured":"Aloise, D., Deshpande, A., Hansen, P., Popat, P.: Np-hardness of euclidean sum- of-squares clustering. Machine Learning\u00a075, 245\u2013249 (2009)","journal-title":"Machine Learning"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Inaba, M., Katoh, N., Imai, H.: Applications of weighted voronoi diagrams and randomization to variance-based k-clustering. In: Proceedings of 10th ACM Symposium on Computational Geometry, pp. 332\u2013339 (1994)","DOI":"10.1145\/177424.178042"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Lloyd, S.P.: Least squares quantization in pcm. IEEE Transactions on information theory IT\u00a028(2) (1982)","DOI":"10.1109\/TIT.1982.1056489"},{"key":"18_CR15","unstructured":"Bradley, P., Bennet, K., Demiriz, A.: Constrained k-means clustering. Technical report, Microsoft Research MSR-TR-2000-65 (2000)"},{"key":"18_CR16","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: The advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1027\u20131035 (2007)"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"G. Croes","year":"1958","unstructured":"Croes, G.: A method for solving traveling salesman problems. Operations Research\u00a06, 791\u2013812 (1958)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Internet of Things, Smart Spaces, and Next Generation Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40316-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T16:53:41Z","timestamp":1558025621000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40316-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403156","9783642403163"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40316-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}