{"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":1777890090390,"version":"3.51.4"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2016,2,29]],"date-time":"2016-02-29T00:00:00Z","timestamp":1456704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Serbian Ministry of Science","award":["174010"],"award-info":[{"award-number":["174010"]}]},{"name":"Serbian Ministry of Science","award":["74033"],"award-info":[{"award-number":["74033"]}]},{"name":"Serbian Ministry of Science","award":["174033"],"award-info":[{"award-number":["174033"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s11590-016-1017-5","type":"journal-article","created":{"date-parts":[[2016,2,29]],"date-time":"2016-02-29T07:13:23Z","timestamp":1456730003000},"page":"1155-1167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A metaheuristic approach to the dominating tree problem"],"prefix":"10.1007","volume":"11","author":[{"given":"Zorica","family":"Dra\u017ei\u0107","sequence":"first","affiliation":[]},{"given":"Mirjana","family":"\u010cangalovi\u0107","sequence":"additional","affiliation":[]},{"given":"Vera","family":"Kova\u010devi\u0107-Vuj\u010di\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,29]]},"reference":[{"issue":"6","key":"1017_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, E.M., Halldorsson, M.M., Hassin, R.: Approximating the tree and tour covers of a graph. Inf. Process. Lett. 47(6), 275\u2013282 (1993)","journal-title":"Inf. Process. Lett."},{"key":"1017_CR2","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1\u201330 (2006)","journal-title":"J. Mach. Learn. Res."},{"issue":"6","key":"1017_CR3","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.: On approximability of the independent\/connected edge dominating set problems. Inf. Process. Lett. 79(6), 261\u2013266 (2001)","journal-title":"Inf. Process. Lett."},{"key":"1017_CR4","first-page":"431","volume-title":"How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover, Automata, Languages and Programming","author":"T Fujito","year":"2006","unstructured":"Fujito, T.: How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover, Automata, Languages and Programming, pp. 431\u2013442. Springer, Berlin, Heidelberg (2006)"},{"issue":"4","key":"1017_CR5","doi-asserted-by":"crossref","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":"1017_CR6","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10288-008-0089-1","volume":"6","author":"P Hansen","year":"2008","unstructured":"Hansen, P., Mladenovi\u0107, N., Moreno-Perez, J.: Variable neighborhood search methods and applications, (invited survey). 4OR: Q. J. Oper. Res. 6, 319\u2013360 (2008)","journal-title":"4OR: Q. J. Oper. Res."},{"key":"1017_CR7","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., Moreno-Perez, J.: Variable neighborhood search algorithms and applications. Ann. Oper. Res. 175, 367\u2013407 (2010)","journal-title":"Ann. Oper. Res."},{"key":"1017_CR8","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighbourhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"1017_CR9","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/j.ejor.2012.02.019","volume":"220","author":"N Mladenovi\u0107","year":"2012","unstructured":"Mladenovi\u0107, N., Kratica, J., Kova\u010devi\u0107-Vuj\u010di\u0107, V., \u010cangalovi\u0107, M.: Variable neighborhood search for metric dimension and minimal doubly set problems. EJOR 220, 328\u2013337 (2012)","journal-title":"EJOR"},{"key":"1017_CR10","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.endm.2012.10.008","volume":"39","author":"N Mladenovi\u0107","year":"2012","unstructured":"Mladenovi\u0107, N., Kratica, J., Kova\u010devi\u0107-Vuj\u010di\u0107, V., \u010cangalovi\u0107, M.: Variable neighborhood search for the strong metric dimension problem. Electron. Notes Discrete Math. 39, 51\u201357 (2012)","journal-title":"Electron. Notes Discrete Math."},{"key":"1017_CR11","doi-asserted-by":"crossref","unstructured":"Park M., Wang C., Willson J., Thai M.T., Wu W., Farago A.: 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, pp. 22\u201331 (2007)","DOI":"10.1145\/1288107.1288111"},{"issue":"6","key":"1017_CR12","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, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"key":"1017_CR13","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, V., Thai, M.: On approximation of dominating tree in wireless sensor networks. Optim. Lett. 4, 393\u2013403 (2010)","journal-title":"Optim. Lett."},{"issue":"12","key":"1017_CR14","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.: New heuristic approaches for the dominating tree problem. Appl. Soft Comput. 13(12), 4695\u20134703 (2013)","journal-title":"Appl. Soft Comput."},{"issue":"7","key":"1017_CR15","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TMC.2007.1034","volume":"6","author":"MT Thai","year":"2007","unstructured":"Thai, M.T., Wang, F., Liu, D., Zhu, S., Du, D.Z.: Connected dominating sets in wireless networks with different transmission ranges. IEEE Trans. Mobile Comput. 6(7), 721\u2013730 (2007)","journal-title":"IEEE Trans. Mobile Comput."},{"key":"1017_CR16","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Alzoubi, K.M., Frieder, O.: Distributed construction on connected dominating set in wireless ad hoc networks. In: Proceedings of the Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3, pp. 1597\u20131604 (2002)","DOI":"10.1109\/INFCOM.2002.1019411"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1017-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1017-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1017-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1017-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:45Z","timestamp":1559409105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1017-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,29]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["1017"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1017-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,29]]}}}