{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T05:46:25Z","timestamp":1749015985998,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"ANID\/FONDECYT","award":["11180107"],"award-info":[{"award-number":["11180107"]}]},{"name":"ANID\/STIC AMSUD","award":["19-STIC-08"],"award-info":[{"award-number":["19-STIC-08"]}]},{"name":"ANID\/FONDECYT Post doctorado","award":["3190147"],"award-info":[{"award-number":["3190147"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Photon Netw Commun"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s11107-022-00963-1","type":"journal-article","created":{"date-parts":[[2022,2,9]],"date-time":"2022-02-09T17:02:43Z","timestamp":1644426163000},"page":"3-12","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Novel cluster partitioning models for visible light communication networks"],"prefix":"10.1007","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2500-3294","authenticated-orcid":false,"given":"Pablo","family":"Adasme","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6567-8988","authenticated-orcid":false,"given":"Fabi\u00e1n","family":"Seguel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6391-6863","authenticated-orcid":false,"given":"Ali","family":"Dehghan Firoozabadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,9]]},"reference":[{"key":"963_CR1","doi-asserted-by":"crossref","unstructured":"Adasme, P., Seguel, F., Dehghan, Firoozabadi, A.: On a clustering partitioning approach for wireless visible light communication networks. In: 2020 IEEE Latin-American Conference on Communications (LATINCOM), pp. 1\u20136, (2020). https:\/\/ieeexplore.ieee.org\/document\/9282330","DOI":"10.1109\/LATINCOM50620.2020.9282330"},{"key":"963_CR2","doi-asserted-by":"publisher","first-page":"7628105:1","DOI":"10.1155\/2020\/7628105","volume":"2020","author":"P Adasme","year":"2020","unstructured":"Adasme, P., Dehghan, F.A.: Degree-constrained k -minimum spanning tree problem. Complex 2020, 7628105:1-7628105:25 (2020). https:\/\/doi.org\/10.1155\/2020\/7628105","journal-title":"Complex"},{"key":"963_CR3","doi-asserted-by":"publisher","first-page":"9723718:1","DOI":"10.1155\/2019\/9723718","volume":"2019","author":"P Adasme","year":"2019","unstructured":"Adasme, P., Dehghan, F.A.: Facility location with tree topology and radial distance constraints. Complex 2019, 9723718:1-9723718:29 (2019). https:\/\/doi.org\/10.1155\/2019\/9723718","journal-title":"Complex"},{"key":"963_CR4","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.asoc.2018.03.008","volume":"67","author":"P Adasme","year":"2018","unstructured":"Adasme, P.: p-Median based formulations with backbone facility locations. Appl. Soft Comput. 67, 261\u2013275 (2018). https:\/\/doi.org\/10.1016\/j.asoc.2018.03.008","journal-title":"Appl. Soft Comput."},{"key":"963_CR5","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.eswa.2018.01.031","volume":"100","author":"P Adasme","year":"2018","unstructured":"Adasme, P., Andrade, R., Leung, J., Lisser, A.: Improved solution strategies for dominating trees. Expert Syst. Appl. 100, 30\u201340 (2018). https:\/\/doi.org\/10.1016\/j.eswa.2018.01.031","journal-title":"Expert Syst. Appl."},{"key":"963_CR6","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.csi.2018.04.002","volume":"61","author":"P Adasme","year":"2019","unstructured":"Adasme, P.: Optimal sub-tree scheduling for wireless sensor networks with partial coverage. Comput. Stand. Interfaces 61, 20\u201335 (2019). https:\/\/doi.org\/10.1016\/j.csi.2018.04.002","journal-title":"Comput. Stand. Interfaces"},{"key":"963_CR7","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.csi.2016.12.004","volume":"52","author":"P Adasme","year":"2017","unstructured":"Adasme, P.: Visible light communication networks under ring and tree topology constraints. Comput. Stand. Interfaces 52, 10\u201324 (2017). https:\/\/doi.org\/10.1016\/j.csi.2016.12.004","journal-title":"Comput. Stand. Interfaces"},{"key":"963_CR8","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.comnet.2016.11.011","volume":"112","author":"P Adasme","year":"2017","unstructured":"Adasme, P., Andrade, R., Lisser, A.: Minimum cost dominating tree sensor networks under probabilistic constraints. Comput. Netw. 112, 208\u2013222 (2017). https:\/\/doi.org\/10.1016\/j.comnet.2016.11.011","journal-title":"Comput. Netw."},{"key":"963_CR9","doi-asserted-by":"crossref","unstructured":"Biswas, K., Muthukkumarasamy, V., Sithirasenan, E.: Maximal clique based clustering scheme for wireless sensor networks. In: 2013 IEEE Eighth International Conference on Intelligent Sensors, Sensor Networks and Information Processing, Melbourne, Australia, pp. 237\u2013241 (2013). https:\/\/ieeexplore.ieee.org\/document\/6529795","DOI":"10.1109\/ISSNIP.2013.6529795"},{"key":"963_CR10","doi-asserted-by":"crossref","unstructured":"Biswas, K., Muthukkumarasamy, V., Sithirasenan, E., Usman, M.: An energy efficient clique based clustering and routing mechanism in wireless sensor networks. In: 2013 9th International Wireless Communications and Mobile Computing Conference (IWCMC), Sardinia, pp. 171\u2013176 (2013). https:\/\/ieeexplore.ieee.org\/document\/6583554","DOI":"10.1109\/IWCMC.2013.6583554"},{"key":"963_CR11","doi-asserted-by":"crossref","unstructured":"Chu, D., Deshpande, A., Hellerstein, J., M., Hong, W.: Approximate data collection in sensor networks using probabilistic models. In: 22nd International Conference on Data Engineering (ICDE\u201906), Atlanta, USA, (2006). https:\/\/ieeexplore.ieee.org\/document\/1617416","DOI":"10.1109\/ICDE.2006.21"},{"key":"963_CR12","unstructured":"https:\/\/docs.anaconda.com\/"},{"key":"963_CR13","first-page":"17","volume":"4","author":"R Fortet","year":"1960","unstructured":"Fortet, R.: Applications de l\u00e1lgebre de boole en recherche operationelle. Revue Francaise d\u2019Automatique, d\u2019Informatique et de Recherche operationelle. 4, 17\u201326 (1960)","journal-title":"Revue Francaise d\u2019Automatique, d\u2019Informatique et de Recherche operationelle."},{"key":"963_CR14","unstructured":"Ghassemlooy, Z., Popoola, W., Rajbhandari, S.: Optical Wireless Communications: System and Channel Modelling with MATLAB. CRC Press, Inc., (2013)"},{"key":"963_CR15","unstructured":"https:\/\/www.gurobi.com\/"},{"key":"963_CR16","doi-asserted-by":"crossref","unstructured":"Melouki, Y., Omari, M.: Simulated annealing approach for clustering in wireless sensor networks. In: 2020 2nd International Conference on Mathematics and Information Technology (ICMIT), pp. 18\u201319 (2020). https:\/\/ieeexplore.ieee.org\/document\/9047029","DOI":"10.1109\/ICMIT47780.2020.9047029"},{"key":"963_CR17","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/net.10004","volume":"38","author":"M Oosten","year":"2001","unstructured":"Oosten, M., Rutten, J., Spieksma, F.: The clique partitioning problem: facets and patching facets. Networks 38, 209\u2013226 (2001). https:\/\/doi.org\/10.1002\/net.10004","journal-title":"Networks"},{"key":"963_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14849-1_25","volume-title":"Theoretical Aspects of Distributed Computing in Sensor Networks. Monographs in Theoretical Computer Science. An EATCS Series","author":"J Stankovic","year":"2011","unstructured":"Stankovic, J., Wood, A., He, T.: Realistic applications for wireless sensor networks. In: Nikoletseas, S., Rolim, J. (eds.) Theoretical Aspects of Distributed Computing in Sensor Networks. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-14849-1_25"},{"key":"963_CR19","doi-asserted-by":"crossref","unstructured":"Tosun, M., Dagdeviren, O.: New heuristic methods for balanced clustering problem in wireless sensor networks. In: 2019 4th International Conference on Computer Science and Engineering (UBMK), Samsun, Turkey, (2019). https:\/\/ieeexplore.ieee.org\/abstract\/document\/8907134","DOI":"10.1109\/UBMK.2019.8907134"},{"key":"963_CR20","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1057\/palgrave.jors.2600510","volume":"49","author":"R Weitz","year":"1998","unstructured":"Weitz, R., Lakshminarayanan, S.: An empirical comparison of heuristic methods for creating maximally diverse groups. J. Oper. Res. Soc. 49, 635\u2013646 (1998). https:\/\/doi.org\/10.1057\/palgrave.jors.2600510","journal-title":"J. Oper. Res. Soc."},{"key":"963_CR21","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/6902152","author":"Y Zhou","year":"2021","unstructured":"Zhou, Y., Shi, J., Wang, Z., Zhang, J., Huang, X., Chi, N.: Maximization of visible light communication capacity employing quasi-linear preequalization with peak power limitation. Math. Probl. Eng. (2021). https:\/\/doi.org\/10.1155\/2016\/6902152","journal-title":"Math. Probl. Eng."}],"container-title":["Photonic Network Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11107-022-00963-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11107-022-00963-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11107-022-00963-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T06:18:47Z","timestamp":1647843527000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11107-022-00963-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["963"],"URL":"https:\/\/doi.org\/10.1007\/s11107-022-00963-1","relation":{},"ISSN":["1387-974X","1572-8188"],"issn-type":[{"type":"print","value":"1387-974X"},{"type":"electronic","value":"1572-8188"}],"subject":[],"published":{"date-parts":[[2022,2]]},"assertion":[{"value":"6 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}