{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:03:48Z","timestamp":1757311428421,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819777976"},{"type":"electronic","value":"9789819777983"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-7798-3_11","type":"book-chapter","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:05:37Z","timestamp":1726769137000},"page":"122-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Distributed Approximation Algorithm for\u00a0the\u00a0Total Dominating Set Problem"],"prefix":"10.1007","author":[{"given":"Limin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaping","family":"Mao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,19]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"106206","DOI":"10.1016\/j.ipl.2021.106206","volume":"174","author":"FN Abu-Khzam","year":"2022","unstructured":"Abu-Khzam, F.N.: An improved exact algorithm for minimum dominating set in chordal graphs. Inf. Process. Lett. 174, 106206 (2022)","journal-title":"Inf. Process. Lett."},{"key":"11_CR2","unstructured":"Alipour S., Futuhi E., Karimi S.: On distributed algorithms for minimum dominating set problem, from theory to application. arXiv preprint arXiv:2012.04883 (2020)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Alipour S., Jafari A.: A local constant approximation factor algorithm for minimum dominating set of certain planar graphs. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures. July, pp. 501\u2013502 (2020)","DOI":"10.1145\/3350755.3400217"},{"issue":"3","key":"11_CR4","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/j.jtbi.2004.05.009","volume":"230","author":"S Allesina","year":"2004","unstructured":"Allesina, S., Bodini, A.: Who dominates whom in the ecosystem? Energy flow bottlenecks and cascading extinctions. J. Theor. Biol. 230(3), 351\u2013358 (2004)","journal-title":"J. Theor. Biol."},{"issue":"02","key":"11_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1142\/S012905410300173X","volume":"14","author":"KM Alzoubi","year":"2003","unstructured":"Alzoubi, K.M., Wan, P.J., Frieder, O.: Maximal independent set, weakly-connected dominating set, and induced spanners in wireless ad hoc networks. Int. J. Found. Comput. Sci. 14(02), 287\u2013303 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Goldberg, A. V., Luby, M., Plotkin, S. A.: Network decomposition and locality in distributed computation. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, pp. 364\u2013369 (1989)","DOI":"10.1109\/SFCS.1989.63504"},{"issue":"7","key":"11_CR7","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.ipl.2014.02.002","volume":"114","author":"Y Belhoul","year":"2014","unstructured":"Belhoul, Y., Yahiaoui, S., Kheddouci, H.: Efficient self-stabilizing algorithms for minimal total $$k$$-dominating sets in graphs. Inf. Process. Lett. 114(7), 339\u2013343 (2014)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"11_CR8","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1109\/TPDS.2013.303","volume":"26","author":"J Chen","year":"2013","unstructured":"Chen, J., He, K., Du, R., Zheng, M., Xiang, Y., Yuan, Q.: Dominating set and network coding-based routing in wireless mesh networks. IEEE Trans. Parallel Distrib. Syst. 26(2), 423\u2013433 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"11","key":"11_CR9","doi-asserted-by":"publisher","first-page":"1264","DOI":"10.1016\/j.ic.2008.07.003","volume":"206","author":"M Chleb\u00edk","year":"2008","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Approximation hardness of dominating set problems in bounded degree graphs. Inf. Comput. 206(11), 1264\u20131275 (2008)","journal-title":"Inf. Comput."},{"issue":"3","key":"11_CR10","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1002\/net.3230100304","volume":"10","author":"EJ Cockayne","year":"1980","unstructured":"Cockayne, E.J., Dawes, R.M., Hedetniemi, S.T.: Total domination in graphs. Networks 10(3), 211\u2013219 (1980)","journal-title":"Networks"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Das, B., Bharghavan, V. : Routing in ad-hoc networks using minimum connected dominating sets. In: Proceedings of ICC\u201997-International Conference on Communications Vol. 1, pp. 376\u2013380, IEEE, (1997)","DOI":"10.1109\/ICC.1997.605303"},{"issue":"4","key":"11_CR12","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/1054916.1054931","volume":"35","author":"M Elkin","year":"2004","unstructured":"Elkin, M.: Distributed approximation: a survey. ACM SIGACT News 35(4), 40\u201357 (2004)","journal-title":"ACM SIGACT News"},{"key":"11_CR13","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1978)"},{"key":"11_CR14","unstructured":"Goddard, W., Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: A self-stabilizing distributed algorithm for minimal total domination in an arbitrary system graph. In: Proceedings International Parallel and Distributed Processing Symposium, IEEE (2003)"},{"issue":"4","key":"11_CR15","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S Guha","year":"1998","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374\u2013387 (1998)","journal-title":"Algorithmica"},{"key":"11_CR16","unstructured":"Haynes T.W., Hedetniemi S.T., Slater P.J.: Fundamentals of Domination in Graphs. Monogr. Textb. Pure Appl. Math. 208 (1998)"},{"key":"11_CR17","unstructured":"Haynes T.W., Hedetniemi S.T., Slater P.J.: Domination in Graphs: Advanced Topics, Chapman and Hall\/CRC Pure and Applied Mathematics Series, vol.209, Marcel Dekker, NewYork (1998)"},{"issue":"4","key":"11_CR18","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1137\/S0895480100375831","volume":"15","author":"TW Haynes","year":"2002","unstructured":"Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T., Henning, M.A.: Domination in graphs applied to electric power networks. SIAM J. Discret. Math. 15(4), 519\u2013529 (2002)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"11_CR19","doi-asserted-by":"publisher","first-page":"417","DOI":"10.2989\/16073600709486210","volume":"30","author":"MA Henning","year":"2007","unstructured":"Henning, M.A., Yeo, A.: A transition from total domination in graphs to transversals in hypergraphs. Quaest. Math. 30(4), 417\u2013436 (2007)","journal-title":"Quaest. Math."},{"issue":"1","key":"11_CR20","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.disc.2007.12.044","volume":"309","author":"MA Henning","year":"2009","unstructured":"Henning, M.A.: A survey of selected recent results on total domination in graphs. Discret. Math. 309(1), 32\u201363 (2009)","journal-title":"Discret. Math."},{"key":"11_CR21","doi-asserted-by":"publisher","unstructured":"Henning, M.A., Yeo, A.: Total domination in graphs. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-6525-6","DOI":"10.1007\/978-1-4614-6525-6"},{"issue":"4","key":"11_CR22","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s00446-002-0078-0","volume":"15","author":"L Jia","year":"2002","unstructured":"Jia, L., Rajaraman, R., Suel, T.: An efficient distributed algorithm for constructing small dominating sets. Distrib. Comput. 15(4), 193\u2013205 (2002)","journal-title":"Distrib. Comput."},{"issue":"3","key":"11_CR23","doi-asserted-by":"publisher","first-page":"388","DOI":"10.3390\/s16030388","volume":"16","author":"P Jiang","year":"2016","unstructured":"Jiang, P., Liu, J., Wu, F., Wang, J., Xue, A.: Node deployment algorithm for underwater sensor networks based on connected dominating set. Sensors 16(3), 388 (2016)","journal-title":"Sensors"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Khanna, S., Motwani, R., Sudan, M., Vazirani, U.: On syntactic versus computational views of approximability. In: Proceeding of the 35th Annual Symposium on the Foundations of Computer Science, pp. 819\u2013830 (1994)","DOI":"10.1109\/SFCS.1994.365712"},{"issue":"4","key":"11_CR25","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s00446-004-0112-5","volume":"17","author":"F Kuhn","year":"2005","unstructured":"Kuhn, F., Wattenhofer, R.: Constant-time distributed dominating set approximation. Distrib. Comput. 17(4), 303\u2013310 (2005)","journal-title":"Distrib. Comput."},{"issue":"3","key":"11_CR26","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1137\/0605040","volume":"5","author":"R Laskar","year":"1984","unstructured":"Laskar, R., Pfaff, J., Hedetniemi, S.M., Hedetniemi, S.T.: On the algorithmic complexity of total domination. SIAM Journal on Algebraic Discrete Methods 5(3), 420\u2013425 (1984)","journal-title":"SIAM Journal on Algebraic Discrete Methods"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Papademitriou, C., Yannakakis M.: Optimization, approximation and complexity classes. In: Proceeding of the 20th Annual ACM Symposium on Theory of Computing, pp.229\u2013234 (1988)","DOI":"10.1145\/62212.62233"},{"key":"11_CR28","unstructured":"Crescenzi, P., Kann, V.: A compendium of NP optimization problems (1995)"},{"issue":"24","key":"11_CR29","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1016\/j.ipl.2012.09.002","volume":"112","author":"O Schaudt","year":"2012","unstructured":"Schaudt, O., Schrader, R.: The complexity of connected dominating sets and total dominating sets with specified induced subgraphs. Inf. Process. Lett. 112(24), 953\u2013957 (2012)","journal-title":"Inf. Process. Lett."},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Zhu J.: Approximation for minimum total dominating set. In: Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human (ICIS \u201909). Association for Computing Machinery, New York, NY, USA, pp. 119\u2013124. DOI:https:\/\/doi.org\/10.1145\/1655925.1655948","DOI":"10.1145\/1655925.1655948"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7798-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:06:39Z","timestamp":1726769199000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7798-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819777976","9789819777983"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7798-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"19 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Aspects in Information and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2024\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}