{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T16:46:40Z","timestamp":1772556400611,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642121883","type":"print"},{"value":"9783642121890","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12189-0_40","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T18:11:05Z","timestamp":1270059065000},"page":"457-467","source":"Crossref","is-referenced-by-count":28,"title":["Hybrid Genetic Algorithm for Minimum Dominating Set Problem"],"prefix":"10.1007","author":[{"given":"Abdel-Rahman","family":"Hedar","sequence":"first","affiliation":[]},{"given":"Rashad","family":"Ismail","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","first-page":"101","volume-title":"Proceedings of the First International Conference on Genetic Algorithms","author":"J.E. Baker","year":"1985","unstructured":"Baker, J.E.: Adaptive selection methods for genetic algorithms. In: Grefenstette, J.J. (ed.) Proceedings of the First International Conference on Genetic Algorithms, pp. 101\u2013111. Lawrence Erlbaum Associates, Hillsdale (1985)"},{"key":"40_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-28356-0","volume-title":"Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques","author":"E.K. Burke","year":"2005","unstructured":"Burke, E.K., Kendall, G.: Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques. Springer, Berlin (2005)"},{"key":"40_CR3","volume-title":"Computers and Intractability: A guide to the theory of NP-Completeness","author":"M.R. Carey","year":"1979","unstructured":"Carey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-Completeness. Freeman, New York (1979)"},{"key":"40_CR4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1080\/15427951.2005.10129105","volume":"2","author":"C. Cooper","year":"2005","unstructured":"Cooper, C., Klasing, R., Zito, M.: Lower bounds and algorithms for dominating sets in web graphs. Internet Math.\u00a02, 275\u2013300 (2005)","journal-title":"Internet Math."},{"key":"40_CR5","volume-title":"Computational Intelligence: An Introduction","author":"A.P. Engelbrecht","year":"2003","unstructured":"Engelbrecht, A.P.: Computational Intelligence: An Introduction. John Wiley & Sons, Chichester (2003)"},{"key":"40_CR6","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/S0097539702419649","volume":"36","author":"F.V. Fomin","year":"2006","unstructured":"Fomin, F.V., Thilikos, D.M.: Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up. SIAM J. Computing\u00a036, 281\u2013309 (2006)","journal-title":"SIAM J. Computing"},{"key":"40_CR7","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)"},{"key":"40_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.jda.2005.03.002","volume":"4","author":"F. Grandoni","year":"2006","unstructured":"Grandoni, F.: A note on the complexity of minimum dominating set. J. Discrete Algorithms\u00a04, 209\u2013214 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"40_CR9","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in graphs. Monographs and Textbooks in Pure and Applied Mathematics. Marcel Dekker, New York (1998)"},{"key":"40_CR10","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of domination in graphs. Monographs and Textbooks in Pure and Applied Mathematics. Marcel Dekker, New York (1998)"},{"key":"40_CR11","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1023\/A:1006504901164","volume":"12","author":"F. Herrera","year":"1998","unstructured":"Herrera, F., Lozano, M., Verdegay, J.L.: Tackling real-coded genetic algorithms: Operators and tools for behavioural analysis. Artificial Intelligence Review\u00a012, 265\u2013319 (1998)","journal-title":"Artificial Intelligence Review"},{"key":"40_CR12","unstructured":"Ho, C.K., Ewe, H.T.: A hybrid ant colony optimization approach (hACO) for constructing load-balanced clusters. In: IEEE Congress on Evolutionary Computation, pp. 2010\u20132017 (2005)"},{"key":"40_CR13","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1080\/08839510600940132","volume":"20","author":"C.K. Ho","year":"2006","unstructured":"Ho, C.K., Singh, Y.P., Ewe, H.T.: An enhanced ant colony optimization metaheuristic for the minimum dominating set problem. Applyed Artificial Intelligence\u00a020, 881\u2013903 (2006)","journal-title":"Applyed Artificial Intelligence"},{"key":"40_CR14","volume-title":"Adaptation in Natural and Artifical Systems","author":"J. Holland","year":"1975","unstructured":"Holland, J.: Adaptation in Natural and Artifical Systems. University of Michigan Press, Ann Arbor (1975)"},{"key":"40_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/b138935","volume-title":"Computational Intelligence: Principles, Techniques and Applications","author":"A. Konar","year":"2005","unstructured":"Konar, A.: Computational Intelligence: Principles, Techniques and Applications. Springer, Berlin (2005)"},{"key":"40_CR16","first-page":"90","volume":"2","author":"D.V. Korobitsyn","year":"1990","unstructured":"Korobitsyn, D.V.: On the complexity of determining the domination number in monogenic classes of graphs. Diskret. Mat.\u00a02, 90\u201396 (1990); in Russian, translation in Discrete Mathematics and Applications 2, 191\u2013199 (1992)","journal-title":"Diskret. Mat."},{"key":"40_CR17","unstructured":"Lozin, V., Milani\u010d, M.: Domination in Graphs of Low Degree. Rutcor Research Report (RRR) New Jersey 27 (2006)"},{"key":"40_CR18","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0304-3975(87)90067-3","volume":"53","author":"H. M\u00fcller","year":"1987","unstructured":"M\u00fcller, H., Brandst\u00e4dt, A.: NP-completeness of STEINER TREE and DOMINATING SET for chordal bipartite graphs. Theoretical Computer Science\u00a053, 257\u2013265 (1987)","journal-title":"Theoretical Computer Science"},{"key":"40_CR19","first-page":"154","volume":"14","author":"H. Samuel","year":"2009","unstructured":"Samuel, H., Zhuang, W.: DTN Based Dominating Set Routing for MANET in Heterogeneous Wireless Networking\u00a014, 154\u2013164 (2009), Springer","journal-title":"Springer"},{"key":"40_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04335-6","volume-title":"Soft computing: integrating evolutionary, neural, and fuzzy systems","author":"A. Tettamanzi","year":"2001","unstructured":"Tettamanzi, A., Tomassini, M., Janben, J.: Soft computing: integrating evolutionary, neural, and fuzzy systems. Springer, Berlin (2001)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12189-0_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:04:38Z","timestamp":1619769878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12189-0_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121883","9783642121890"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12189-0_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}