{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:21:30Z","timestamp":1777890090424,"version":"3.51.4"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,11,13]],"date-time":"2014-11-13T00:00:00Z","timestamp":1415836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s00500-014-1513-4","type":"journal-article","created":{"date-parts":[[2014,11,13]],"date-time":"2014-11-13T15:00:58Z","timestamp":1415890858000},"page":"377-397","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["A hybrid heuristic for dominating tree problem"],"prefix":"10.1007","volume":"20","author":[{"given":"Sachchida Nand","family":"Chaurasia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alok","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"1513_CR1","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0020-0190(93)90072-H","volume":"47","author":"EM Arkin","year":"1993","unstructured":"Arkin EM, Halld\u00f3rsson MM, Hassin R (1993) Approximating the tree and tour covers of a graph. Inf Process Lett 47:275\u2013282","journal-title":"Inf Process Lett"},{"key":"1513_CR2","doi-asserted-by":"crossref","unstructured":"Fujito T (2001) On approximability of the independent\/connected edge dominating set problems. Inf Process Lett 79:261\u2013266","DOI":"10.1016\/S0020-0190(01)00138-7"},{"key":"1513_CR3","doi-asserted-by":"crossref","unstructured":"Fujito T (2006) How to trim an mst: a 2-approximation algorithm for minimum cost tree cover. In: Bugliesi M, Preneel B, Sassone V, Wegener I (eds) Automata, languages and programming, Lecture Notes in Computer Science, vol 4051. Springer, Berlin, Heidelberg, pp 431\u2013442","DOI":"10.1007\/11786986_38"},{"issue":"4","key":"1513_CR4","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":"1513_CR5","doi-asserted-by":"crossref","unstructured":"Park MA, Willson J, Wang C, Thai M, Wu W, Farago A (2007) A dominating and absorbent set in a wireless ad-hoc network with different transmission ranges. In: Proceedings of the 8th ACM international symposium on mobile ad hoc networking and computing, MobiHoc \u201907. ACM, New York, pp 22\u201331","DOI":"10.1145\/1288107.1288111"},{"key":"1513_CR6","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim RC (1957) Shortest connection networks and some generalizations. Bell Syst Tech J 36:1389\u20131401","journal-title":"Bell Syst Tech J"},{"key":"1513_CR7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/TEVC.2002.807275","volume":"7","author":"G Raidl","year":"2003","unstructured":"Raidl G, Julstrom B (2003) Edge-sets: an effective evolutionary coding of spanning trees. IEEE Trans Evolut Comput 7:225\u2013239","journal-title":"IEEE Trans Evolut Comput"},{"issue":"3","key":"1513_CR8","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 MT (2010) On approximation of dominating tree in wireless sensor networks. Optim Lett 4(3):393\u2013403","journal-title":"Optim Lett"},{"issue":"12","key":"1513_CR9","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(12):4695\u20134703","journal-title":"Appl Soft Comput"},{"issue":"7","key":"1513_CR10","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TMC.2007.1034","volume":"6","author":"MT Thai","year":"2007","unstructured":"Thai MT, Wang F, Liu D, Zhu S, Du D-Z (2007) Connected dominating sets in wireless networks with different transmission ranges. IEEE Trans Mobile Comput 6(7):721\u2013730","journal-title":"IEEE Trans Mobile Comput"},{"issue":"9","key":"1513_CR11","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/TMC.2008.22","volume":"7","author":"MT Thaiand","year":"2008","unstructured":"Thaiand MT, Tiwari R, Du D-Z (2008) On construction of virtual backbone in wireless ad hoc networks with unidirectional links. IEEE Trans Mobile Comput 7(9):1098\u20131109","journal-title":"IEEE Trans Mobile Comput"},{"key":"1513_CR12","doi-asserted-by":"crossref","unstructured":"Wan P-J, Alzoubi KM, Frieder O (2002) Distributed construction of connected dominating set in wireless ad hoc networks. In: Proceedings of the twenty-first annual joint conference of the IEEE Computer and Communications Societies (INFOCOM 2002), vol 3, pp 1597\u20131604","DOI":"10.1109\/INFCOM.2002.1019411"},{"key":"1513_CR13","doi-asserted-by":"crossref","unstructured":"Wu J, Hailan L (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, DIALM \u201999. ACM, New York, pp 7\u201314","DOI":"10.1145\/313239.313261"},{"key":"1513_CR14","doi-asserted-by":"crossref","unstructured":"Zhang N, Shin I, Li B, Boyaci C, Tiwari R, Thaiand MT (2008) New approximation for minimum-weight routing backbone in wireless sensor network. Wireless algorithms, systems, and applications, Lecture Notes in Computer Science, vol 5258. Springer, Berlin, Heidelberg, pp 96\u2013108","DOI":"10.1007\/978-3-540-88582-5_12"},{"key":"1513_CR15","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/TEVC.2004.840835","volume":"9","author":"Q Zhang","year":"2005","unstructured":"Zhang Q, Sun J, Tsang E (2005) An evolutionary algorithm with guided mutation for the maximum clique problem. IEEE Trans Evolut Comput 9:192\u2013200","journal-title":"IEEE Trans Evolut Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1513-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-014-1513-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1513-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,17]],"date-time":"2019-08-17T05:18:44Z","timestamp":1566019124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-014-1513-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,13]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["1513"],"URL":"https:\/\/doi.org\/10.1007\/s00500-014-1513-4","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,13]]}}}