{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T23:35:22Z","timestamp":1725924922547},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"S1","license":[{"start":{"date-parts":[[2016,6,17]],"date-time":"2016-06-17T00:00:00Z","timestamp":1466121600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61370156","61402070","61403076","61403077"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004602","name":"Program for New Century Excellent Talents in University","doi-asserted-by":"publisher","award":["NCET-13-0724"],"id":[{"id":"10.13039\/501100004602","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s00521-016-2429-y","type":"journal-article","created":{"date-parts":[[2016,6,17]],"date-time":"2016-06-17T16:24:23Z","timestamp":1466180663000},"page":"1059-1067","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["GRASP for connected dominating set problems"],"prefix":"10.1007","volume":"28","author":[{"given":"Ruizhi","family":"Li","sequence":"first","affiliation":[]},{"given":"Shuli","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Yupeng","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Yiyuan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,17]]},"reference":[{"key":"2429_CR1","volume-title":"Graphs and hypergraphs[M]","author":"C Berge","year":"1973","unstructured":"Berge C (1973) Graphs and hypergraphs[M]. North-Holland Publishing Company, Amsterdam"},{"key":"2429_CR2","volume-title":"Introduction to combinatorial mathematics[M]","author":"CL Liu","year":"1968","unstructured":"Liu CL (1968) Introduction to combinatorial mathematics[M]. McGraw-Hill, New York"},{"key":"2429_CR3","volume-title":"Diffusion of innovation","author":"CA Benedetto Di","year":"2010","unstructured":"Di Benedetto CA (2010) Diffusion of innovation. Wiley, Chichester"},{"key":"2429_CR4","volume-title":"Network models of the diffusion of innovations","author":"TW Valente","year":"1995","unstructured":"Valente TW (1995) Network models of the diffusion of innovations. Hampton Press, Cresskill"},{"key":"2429_CR5","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"issue":"3","key":"2429_CR6","first-page":"1","volume":"9","author":"J Goldenberg","year":"2001","unstructured":"Goldenberg J, Libai B, Muller E (2001) Using complex systems analysis to advance marketing theory development: modeling heterogeneity effects on new product growth through stochastic cellular automata. Acad Mark Sci Rev 9(3):1\u201318","journal-title":"Acad Mark Sci Rev"},{"issue":"6","key":"2429_CR7","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/37.969135","volume":"21","author":"C Asavathiratham","year":"2001","unstructured":"Asavathiratham C, Roy S, Lesieutre B et al (2001) The influence model. Control Syst IEEE 21(6):52\u201364","journal-title":"Control Syst IEEE"},{"issue":"3","key":"2429_CR8","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 (2005) Lower bounds and algorithms for dominating sets in web graphs. Internet Math 2(3):275\u2013300","journal-title":"Internet Math"},{"issue":"6988","key":"2429_CR9","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1038\/nature02541","volume":"429","author":"S Eubank","year":"2004","unstructured":"Eubank S, Guclu H, Kumar VSA et al (2004) Modelling disease outbreaks in realistic urban social networks. Nature 429(6988):180\u2013184","journal-title":"Nature"},{"issue":"1","key":"2429_CR10","first-page":"43","volume":"27","author":"EA Stanley","year":"2006","unstructured":"Stanley EA (2006) Social networks and mathematical modeling. Connections 27(1):43\u201349","journal-title":"Connections"},{"key":"2429_CR11","volume-title":"Computers and intractability, a guide to the theory of NP\u2014completeness","author":"M Garey","year":"1979","unstructured":"Garey M, Johnson DS (1979) Computers and intractability, a guide to the theory of NP\u2014completeness. Freeman, San Francisco"},{"issue":"1\u20133","key":"2429_CR12","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.tcs.2004.08.013","volume":"329","author":"L Ruan","year":"2004","unstructured":"Ruan L, Du H, Jia X, Wu W, Li Y, Ko KI (2004) A greedy approximation for minimum connected dominating sets. Theor Comput Sci 329(1\u20133):325\u2013330","journal-title":"Theor Comput Sci"},{"key":"2429_CR13","unstructured":"Cheng X, Ding M, Chen D (2004) An approximation algorithm for connected dominating set in ad hoc networks. In: Proceedings of the international workshop on theoretical aspects of wireless ad hoc, sensor and peer-to-peer networks (TAWN)"},{"issue":"1","key":"2429_CR14","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10898-005-8466-1","volume":"35","author":"M Min","year":"2006","unstructured":"Min M, Du H, Jia X, Huang CX, Huang SCH, Wu W (2006) Improving construction for connected dominating set with Steiner tree in wireless sensor networks. J Glob Optim 35(1):111\u2013119","journal-title":"J Glob Optim"},{"issue":"4","key":"2429_CR15","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S Guha","year":"1998","unstructured":"Guha S, Khuller S (1998) Approximation algorithms for connected dominating sets. Algorithmica 20(4):374\u2013387","journal-title":"Algorithmica"},{"key":"2429_CR16","doi-asserted-by":"crossref","unstructured":"Butenko S, Cheng X, Oliveira C, Pardalos P (2004) A new heuristic for the minimum connected dominating set problem on ad hoc wireless networks. In: Butenko S (Ed) Recent developments in cooperative control and optimization. Kluwer Academic Publishers, New York, pp 61\u201373","DOI":"10.1007\/978-1-4613-0219-3_4"},{"key":"2429_CR17","unstructured":"Butenko S, Oliveira C, Pardalos P (2003) A new algorithm for the minimum connected dominating set problem on ad hoc wireless networks. In: CCCT\u201903. International Institute of Informatics and Systematics (IIIS), pp 39\u201344"},{"issue":"4","key":"2429_CR18","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1287\/ijoc.2013.0589","volume":"26","author":"B Gendron","year":"2014","unstructured":"Gendron B, Lucena A, da Cunha AS et al (2014) Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem. INFORMS J Comput 26(4):645\u2013657","journal-title":"INFORMS J Comput"},{"issue":"3","key":"2429_CR19","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1109\/TPDS.2009.78","volume":"21","author":"R Misra","year":"2010","unstructured":"Misra R, Mandal C (2010) Minimum connected dominating set using a collaborative cover heuristic for ad hoc sensor networks. IEEE Trans Parallel Distrib Syst 21(3):292\u2013302","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"2429_CR20","doi-asserted-by":"crossref","unstructured":"Morgan M, Grout V (2007) Metaheuristics for wireless network optimisation. In: The third advanced international conference on telecommunications, AICT 2007, p 15, May 2007","DOI":"10.1109\/AICT.2007.28"},{"issue":"6","key":"2429_CR21","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1109\/TNN.2009.2015088","volume":"20","author":"H He","year":"2009","unstructured":"He H, Zhu Z, Makinen E (2009) A neural network model to minimize the connected dominating set for self-configuration of wireless sensor networks. IEEE Trans Neural Netw 20(6):973\u2013982","journal-title":"IEEE Trans Neural Netw"},{"issue":"1","key":"2429_CR22","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.ipl.2008.09.017","volume":"109","author":"RG Downey","year":"2008","unstructured":"Downey RG, Fellows MR, McCartin C, Rosamond FA (2008) Parameterized approximation of dominating set problems. Inf Process Lett 109(1):68\u201370","journal-title":"Inf Process Lett"},{"issue":"1","key":"2429_CR23","doi-asserted-by":"crossref","first-page":"133","DOI":"10.2298\/CSIS110927038J","volume":"10","author":"R Jovanovic","year":"2013","unstructured":"Jovanovic R, Tuba M (2013) Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem. Comput Sci Inf Syst 10(1):133\u2013149","journal-title":"Comput Sci Inf Syst"},{"key":"2429_CR24","doi-asserted-by":"crossref","unstructured":"Nimisha TS, Ramalakshmi R (2015) Energy efficient connected dominating set construction using ant colony optimization technique in wireless sensor network. In: Innovations in information, embedded and communication systems (ICIIECS), 2015 international conference on IEEE, 2015, pp 1\u20135","DOI":"10.1109\/ICIIECS.2015.7192912"},{"key":"2429_CR25","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo TA, Resende MGC (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8:67\u201371","journal-title":"Oper Res Lett"},{"key":"2429_CR26","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Glob Optim 6:109\u2013133","journal-title":"J Glob Optim"},{"key":"2429_CR27","first-page":"219","volume-title":"Handbook of metaheuristics","author":"MGC Resende","year":"2002","unstructured":"Resende MGC, Ribeiro CC (2002) Greedy randomized adaptive search procedures. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer Academic Publishers, Norwell, pp 219\u2013249"},{"key":"2429_CR28","volume-title":"Handbook of metaheuristics","author":"MGC Resende","year":"2010","unstructured":"Resende MGC, Ribeiro CC (2010) Greedy randomized adaptive search procedures: advances and applications. In: Gendreau M, Potvin J-Y (eds) Handbook of metaheuristics, 2nd edn. Springer, Berlin","edition":"2"},{"key":"2429_CR29","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/978-1-4615-1507-4_15","volume-title":"Essays and surveys on metaheuristics","author":"P Festa","year":"2002","unstructured":"Festa P, Resende MGC (2002) GRASP: an annotated bibliography. In: Ribeiro CC, Hansen P (eds) Essays and surveys on metaheuristics. Kluwer Academic Publishers, Boston, pp 325\u2013367"},{"key":"2429_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1475-3995.2009.00663.x","volume":"16","author":"P Festa","year":"2009","unstructured":"Festa P, Resende MGC (2009) An annotated bibliography of GRASP\u2014Part I: algorithms. Int Trans Oper Res 16:1\u201324","journal-title":"Int Trans Oper Res"},{"issue":"2","key":"2429_CR31","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1111\/j.1475-3995.2009.00664.x","volume":"16","author":"P Festa","year":"2009","unstructured":"Festa P, Resende MGC (2009) An annotated bibliography of GRASP\u2014Part II: applications. Int Trans Oper Res 16(2):131\u2013172","journal-title":"Int Trans Oper Res"},{"key":"2429_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2324-6","author":"Y Wang","year":"2016","unstructured":"Wang Y, Li R, Zhou Y, Yin M (2016) A path cost-based GRASP for minimum independent dominating set problem. Neural Comput Appl. doi: 10.1007\/s00521-016-2324-6","journal-title":"Neural Comput Appl"},{"issue":"10","key":"2429_CR33","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1080\/08839510600940132","volume":"20","author":"CK Ho","year":"2006","unstructured":"Ho CK, Singh YP, Ewe HT (2006) An enhanced ant colony optimization metaheuristic for the minimum dominating set problem. Appl Artif Intell 20(10):881\u2013903","journal-title":"Appl Artif Intell"},{"key":"2429_CR34","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1166\/jctn.2016.4869","volume":"13","author":"Y Zhou","year":"2016","unstructured":"Zhou Y, Zhang H, Li R, Wang J (2016) Two local search algorithms for partition vertex cover problem. J Comput Theor Nanosci 13:743\u2013751","journal-title":"J Comput Theor Nanosci"},{"issue":"7\u20138","key":"2429_CR35","doi-asserted-by":"crossref","first-page":"1867","DOI":"10.1007\/s00521-013-1433-8","volume":"24","author":"X Li","year":"2014","unstructured":"Li X, Zhang J, Yin M (2014) Animal migration optimization: an optimization algorithm inspired by animal migration behavior. Neural Comput Appl 24(7\u20138):1867\u20131877","journal-title":"Neural Comput Appl"},{"issue":"6","key":"2429_CR36","doi-asserted-by":"crossref","first-page":"1233","DOI":"10.1007\/s00521-013-1354-6","volume":"24","author":"X Li","year":"2014","unstructured":"Li X, Wang J, Yin M (2014) Enhancing the performance of cuckoo search algorithm using orthogonal learning method. Neural Comput Appl 24(6):1233\u20131247","journal-title":"Neural Comput Appl"},{"issue":"3\u20134","key":"2429_CR37","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1007\/s00521-012-1285-7","volume":"24","author":"X Li","year":"2014","unstructured":"Li X, Yin M (2014) Self adaptive constrained Artificial Bee Colony for constrained numerical optimization. Neural Comput Appl 24(3\u20134):723\u2013734","journal-title":"Neural Comput Appl"},{"key":"2429_CR38","doi-asserted-by":"crossref","unstructured":"Wang Y, Cai S, Yin M (2016) Two efficient local search algorithms for maximum weight clique problem. In: AAAI2016","DOI":"10.1609\/aaai.v30i1.10067"},{"key":"2429_CR39","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12280","author":"Y Wang","year":"2016","unstructured":"Wang Y, Yin M, Ouyang D, Zhang L (2016) A novel local search algorithm with configuration checking and scoring mechanism for the set k-covering problem. Int Trans Oper Res. doi: 10.1111\/itor.12280","journal-title":"Int Trans Oper Res"},{"issue":"3","key":"2429_CR40","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search\u2014part I. ORSA J Comput 1(3):190\u2013206","journal-title":"ORSA J Comput"},{"key":"2429_CR41","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-2172-9","author":"R Li","year":"2016","unstructured":"Li R, Hu S, Wang Y, Yin M (2016) A local search algorithm with tabu strategy and perturbation mechanism for generalized vertex cover problem. Neural Comput Appl. doi: 10.1007\/s00521-015-2172-9","journal-title":"Neural Comput Appl"},{"key":"2429_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2339-z","author":"X Zhang","year":"2016","unstructured":"Zhang X, Li X, Wang J (2016) Local search algorithm with path relinking for single batch-processing machine scheduling problem. Neural Comput Appl. doi: 10.1007\/s00521-016-2339-z","journal-title":"Neural Comput Appl"},{"key":"2429_CR43","doi-asserted-by":"crossref","first-page":"6088","DOI":"10.1166\/jctn.2015.4549","volume":"12","author":"R Li","year":"2015","unstructured":"Li R, Hu S, Wang J (2015) The community structure of the constraint satisfaction problem instances of model RB. J Comput Theor Nanosci 12:6088\u20136093","journal-title":"J Comput Theor Nanosci"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-016-2429-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2429-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2429-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2429-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T21:59:31Z","timestamp":1656712771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-016-2429-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,17]]},"references-count":43,"journal-issue":{"issue":"S1","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["2429"],"URL":"https:\/\/doi.org\/10.1007\/s00521-016-2429-y","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,17]]}}}