{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T21:06:04Z","timestamp":1761599164559},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2017,11,4]],"date-time":"2017-11-04T00:00:00Z","timestamp":1509753600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10489-017-1075-0","type":"journal-article","created":{"date-parts":[[2017,11,3]],"date-time":"2017-11-03T23:30:53Z","timestamp":1509751853000},"page":"2247-2267","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Two new heuristics for the dominating tree problem"],"prefix":"10.1007","volume":"48","author":[{"given":"Kavita","family":"Singh","sequence":"first","affiliation":[]},{"given":"Shyam","family":"Sundar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,4]]},"reference":[{"key":"1075_CR1","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0020-0190(93)90072-H","volume":"47","author":"E Arkin","year":"1993","unstructured":"Arkin E, Halldorssom M, Hassin R (1993) Approximating the tree and tour covers of a graph. Inf Process Lett 47:275\u2013282","journal-title":"Inf Process Lett"},{"key":"1075_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00500-015-1933-9","volume":"20","author":"SN Chaurasia","year":"2016","unstructured":"Chaurasia SN, Singh A (2016) A hybrid heuristic for dominating tree problem. Soft Comput Springer 20:1\u201321","journal-title":"Soft Comput Springer"},{"key":"1075_CR3","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1007\/s11590-016-1017-5","volume":"11","author":"Z Drazic","year":"2017","unstructured":"Drazic Z, Cangalovic M, Kovacevic-Vujcic V (2017) A metaheuristic approach to the dominating tree problem. Optim Lett Springer 11:1155\u20131167","journal-title":"Optim Lett Springer"},{"key":"1075_CR4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0020-0190(01)00138-7","volume":"79","author":"T Fujito","year":"2001","unstructured":"Fujito T (2001) On approximability of the independent\/connected edge dominating set problems. Inf Process Lett 79:261\u2013266","journal-title":"Inf Process Lett"},{"key":"1075_CR5","unstructured":"Fujito T (2006) How to trim an MST: A 2-approximation algorithm for minimum cost tree cover. In: Proceedings of the 33rd international colloquium on automata, languages and programming, ICALP, Part I. Venice, July 10-14, 2006, pp 431\u2013442"},{"key":"1075_CR6","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:374\u2013387","journal-title":"Algorithmica"},{"key":"1075_CR7","volume-title":"An idea based on honey bee swarm for numerical optimization. Computer Engineering Department Engineering Faculty","author":"D Karaboga","year":"2005","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Computer Engineering Department Engineering Faculty. Erciyes University, Turkey"},{"issue":"1","key":"1075_CR8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10462-012-9328-0","volume":"42","author":"D Karaboga","year":"2014","unstructured":"Karaboga D, Gorkemli B, Ozturk C, Karaboga N (2014) A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif Intell Rev 42(1):21\u201357","journal-title":"Artif Intell Rev"},{"key":"1075_CR9","doi-asserted-by":"crossref","unstructured":"Park M, Wang C, Willson J, Thai M, Wu W, Farago A (2007) A dominating and absorbent set in wireless ad-hoc networks with different transmission range. In: Proceedings of the 8th ACM international symposium on mobile ad hoc networking and computing (MOBIHOC)","DOI":"10.1145\/1288107.1288111"},{"key":"1075_CR10","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R Prim","year":"1957","unstructured":"Prim R (1957) Shortest connection networks and some generalizations. Bell Syst Techn J 36:1389\u20131401","journal-title":"Bell Syst Techn J"},{"key":"1075_CR11","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s11590-010-0175-0","volume":"4","author":"I Shin","year":"2010","unstructured":"Shin I, Shen Y, Thai M (2010) On approximation of dominating tree in wireless sensor networks. Optim Lett 4:393\u2013403","journal-title":"Optim Lett"},{"key":"1075_CR12","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/j.asoc.2008.09.001","volume":"9","author":"A Singh","year":"2009","unstructured":"Singh A (2009) An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl Soft Comput Elsevier 9:625\u2013631","journal-title":"Appl Soft Comput Elsevier"},{"key":"1075_CR13","doi-asserted-by":"crossref","unstructured":"Sundar S (2014) A steady-state genetic algorithm for the dominating tree problem. In: Proceedings of the tenth international conference on simulated evolution and learning (SEAL 2014), LNCS, vol 8886. Springer-Verlag, Dunedin, pp 48\u201357","DOI":"10.1007\/978-3-319-13563-2_5"},{"key":"1075_CR14","doi-asserted-by":"crossref","first-page":"3182","DOI":"10.1016\/j.ins.2010.05.001","volume":"180","author":"S Sundar","year":"2010","unstructured":"Sundar S, Singh A (2010) A swarm intelligence approach to the quadratic minimum spanning tree problem. Inf Sci Elsevier 180:3182\u20133191","journal-title":"Inf Sci Elsevier"},{"key":"1075_CR15","doi-asserted-by":"crossref","first-page":"4695","DOI":"10.1016\/j.asoc.2013.07.014","volume":"13","author":"S Sundar","year":"2013","unstructured":"Sundar S, Singh A (2013) New heuristic approaches for the dominating tree problem. Appl Soft Comput 13:4695\u20134703","journal-title":"Appl Soft Comput"},{"key":"1075_CR16","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1007\/s00500-015-1852-9","volume":"21","author":"S Sundar","year":"2017","unstructured":"Sundar S, Suganthan PN, Jin CT, Xiang CT, Soon CC (2017) A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint. Soft Comput Springer 21:1193\u20131202","journal-title":"Soft Comput Springer"},{"key":"1075_CR17","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TMC.2007.1034","volume":"6","author":"M Thai","year":"2007","unstructured":"Thai M, Wang F, Liu D, Zhu S, Du DZ (2007) Connected dominating sets in wireless networks with different transmission ranges. IEEE Trans Mob Comput 6:721\u2013730","journal-title":"IEEE Trans Mob Comput"},{"key":"1075_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TMC.2008.22","volume":"7","author":"M Thai","year":"2008","unstructured":"Thai M, Tiwari R, Du DZ (2008) On construction of virtual backbone in wireless ad hoc networks with unidirectional links. IEEE Trans Mob Comput 7:1\u201312","journal-title":"IEEE Trans Mob Comput"},{"key":"1075_CR19","unstructured":"Wan P, Alzoubi KM, Frieder O (2002) Distributed construction on connected dominating set in wireless ad hoc networks. In: Proceedings IEEE INFOCOM 2002, the 21st annual joint conference of the IEEE computer and communications societies. New York, June 23-27, 2002, pp 1597\u20131604"},{"key":"1075_CR20","doi-asserted-by":"crossref","unstructured":"Wu J, Li H (1999) On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proceedings of the 3rd international workshop on discrete algorithms and methods for mobile computing and communications (DIAL-M 1999). Seattle, Washington, August 20, 1999, pp 7\u201314","DOI":"10.1145\/313239.313261"},{"key":"1075_CR21","doi-asserted-by":"crossref","unstructured":"Zhang N, Shin I, Li B, Boyaci C, Tiwari R, Thai M (2008) New approximation for minimum-weight routing backbone in wireless sensor network. In: Lecture notes in computer science, vol 5258. Springer-Verlag, Berlin, pp 96\u2013108","DOI":"10.1007\/978-3-540-88582-5_12"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-017-1075-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-1075-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-1075-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,17]],"date-time":"2018-07-17T03:25:18Z","timestamp":1531797918000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-017-1075-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,4]]},"references-count":21,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["1075"],"URL":"https:\/\/doi.org\/10.1007\/s10489-017-1075-0","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,4]]}}}