{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:03:53Z","timestamp":1760234633895,"version":"build-2065373602"},"reference-count":8,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2021,6,8]],"date-time":"2021-06-08T00:00:00Z","timestamp":1623110400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Known to be NP-complete, domination number problems in graphs and networks arise in many real-life applications, ranging from the design of wireless sensor networks and biological networks to social networks. Initially introduced by Blessing et al., the (t,r) broadcast domination number is a generalization of the distance domination number. While some theoretical approaches have been addressed for small values of t,r in the literature; in this work, we propose an approach from an optimization point of view. First, the (t,r) broadcast domination number is formulated and solved using linear programming. The efficient broadcast, whose wasted signals are minimized, is then found by a genetic algorithm modified for a binary encoding. The developed method is illustrated with several grid graphs: regular, slant, and king\u2019s grid graphs. The obtained computational results show that the method is able to find the exact (t,r) broadcast domination number, and locate an efficient broadcasting configuration for larger values of t,r than what can be provided from a theoretical basis. The proposed optimization approach thus helps overcome the limitations of existing theoretical approaches in graph theory.<\/jats:p>","DOI":"10.3390\/sym13061028","type":"journal-article","created":{"date-parts":[[2021,6,8]],"date-time":"2021-06-08T21:16:58Z","timestamp":1623187018000},"page":"1028","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimization Models for Efficient (t, r) Broadcast Domination in Graphs"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7261-3135","authenticated-orcid":false,"given":"Poompol","family":"Buathong","sequence":"first","affiliation":[{"name":"Department of Mathematics, Faculty of Science, Mahidol University, Bangkok 10400, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8300-2631","authenticated-orcid":false,"given":"Tipaluck","family":"Krityakierne","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Faculty of Science, Mahidol University, Bangkok 10400, Thailand"},{"name":"Centre of Excellence in Mathematics, CHE, Bangkok 10400, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,6,8]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.dam.2015.02.005","article-title":"On (t, r) broadcast domination numbers of grids","volume":"187","author":"Blessing","year":"2015","journal-title":"Discret. Appl. Math."},{"key":"ref_2","unstructured":"Crepeau, N., Harris, P.E., Hays, S., Loving, M., Rennie, J., Kirby, G.R., and Vasquez, A. (2019). On (t,r) broadcast domination of certain grid graphs. arXiv."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.dam.2018.08.009","article-title":"Optimal (t, r) broadcasts on the infinite grid","volume":"255","author":"Drews","year":"2019","journal-title":"Discret. Appl. Math."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.dam.2020.11.014","article-title":"The (t, r) broadcast domination number of some regular graphs","volume":"289","author":"Herrman","year":"2021","journal-title":"Discret. Appl. Math."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.dam.2019.08.025","article-title":"Efficient (t, r) broadcast dominating sets of the triangular lattice","volume":"277","author":"Harris","year":"2020","journal-title":"Discret. Appl. Math."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Duraisamy, P., and Esakkimuthu, S. (2020). Linear programming approach for various domination parameters. Discret. Math. Algorithms Appl., 2050096.","DOI":"10.1142\/S1793830920500962"},{"key":"ref_7","first-page":"146","article-title":"Integer linear programming models for the weighted total domination problem","volume":"358","author":"Ma","year":"2019","journal-title":"Appl. Math. Comput."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Cai, Q., Fan, N., Shi, Y., and Yao, S. (2019). Integer linear programming formulations for double roman domination problem. Optim. Methods Softw., 1\u201322.","DOI":"10.1080\/10556788.2019.1679142"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/6\/1028\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:11:59Z","timestamp":1760163119000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/6\/1028"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,8]]},"references-count":8,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2021,6]]}},"alternative-id":["sym13061028"],"URL":"https:\/\/doi.org\/10.3390\/sym13061028","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2021,6,8]]}}}