{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T05:50:51Z","timestamp":1750830651940},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2016,1,29]],"date-time":"2016-01-29T00:00:00Z","timestamp":1454025600000},"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":["Optim Lett"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s11590-016-1007-7","type":"journal-article","created":{"date-parts":[[2016,1,29]],"date-time":"2016-01-29T10:41:03Z","timestamp":1454064063000},"page":"1393-1401","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs"],"prefix":"10.1007","volume":"10","author":[{"given":"Zhao","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Joong-Lyul","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,29]]},"reference":[{"key":"1007_CR1","unstructured":"Bharghavan, V., Das, B.: Routing in ad hoc networks using minimum connected dominating sets. In: International Conference on Communication, Montreal (1997)"},{"key":"1007_CR2","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1002\/net.10097","volume":"42","author":"X Cheng","year":"2003","unstructured":"Cheng, X., Huang, X., Li, D., Wu, W., Du, D.-Z.: A polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Networks 42, 202\u2013208 (2003)","journal-title":"Networks"},{"key":"1007_CR3","doi-asserted-by":"crossref","unstructured":"Ding, L., Gao, X., Wu, W., Lee, W., Zhu, X., Du, D.-Z.: Distributed construction of connected dominating sets with minimum routing cost in wireless network. In: The 30th International Conference on Distributed Computing Systems (ICDCS), pp. 448\u2013457 (2010)","DOI":"10.1109\/ICDCS.2010.17"},{"key":"1007_CR4","doi-asserted-by":"crossref","unstructured":"Ding, L., Wu, W., Willson, J., Du, H., Lee, W., Du, D.-Z.: Efficient algorithms for topology control problem with minimum routing constraints in wireless networks. In: IEEE Transactions on Parallel and Distributed Systems, vol. 22(10), pp. 1601\u20131609 (2011)","DOI":"10.1109\/TPDS.2011.30"},{"issue":"2","key":"1007_CR5","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s11590-010-0208-8","volume":"5","author":"L Ding","year":"2011","unstructured":"Ding, L., Gao, X., Weili, W., Wonjun Lee, X., Du Zhu, Ding-Zhu: An exact algorithm for minimum CDS with shortest path constraint in wireless networks. Optim. Lett. 5(2), 297\u2013306 (2011)","journal-title":"Optim. Lett."},{"key":"1007_CR6","unstructured":"Du, D.-Z., Graham, R.L., Pardalos, P.M., Wan, P.-J., Wu, W., Zhao, W.: Analysis of greedy approximations with nonsubmodular potential functions. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Dicrete Algorithms (SODA), pp. 167\u2013175, San Francisco, 20\u201322 January 2008 (2008)"},{"key":"1007_CR7","doi-asserted-by":"crossref","unstructured":"Du, H., Ye, Q., Wu, W., Li, D., Du, D.-Z., Howard, S.: Constant approximation for virtual backbone construction with guaranteed routing cost in wireless sensor networks. In: INFOCOM, pp.1737\u20131744 (2011)","DOI":"10.1109\/INFCOM.2011.5934967"},{"issue":"4","key":"1007_CR8","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1109\/TPDS.2012.177","volume":"24","author":"H Du","year":"2013","unstructured":"Du, H., Wu, W., Ye, Q., Li, D., Lee, W., Xu, X.: CDS-based virtual backbone construction with guaranteed routing cost in wireless sensor networks. IEEE Trans. Parallel Distrib. Syst. 24(4), 652\u2013661 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"1007_CR9","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s11590-009-0148-3","volume":"4","author":"X Gao","year":"2010","unstructured":"Gao, X., Wang, W., Zhang, Z., Zhu, S., Weili, W.: A PTAS for minimum d-hop connected dominating set in growth-bounded graphs. Optim. Lett. 4(3), 321\u2013333 (2010)","journal-title":"Optim. Lett."},{"key":"1007_CR10","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF01159721","volume":"73","author":"H Groemer","year":"1960","unstructured":"Groemer, H.: \u00dcber die Einlagerung von Kreisen in einen konvexen Bereich. Math. Z. 73, 285\u2013294 (1960)","journal-title":"Math. Z."},{"key":"1007_CR11","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, 374\u2013387 (1998)","journal-title":"Algorithmica"},{"issue":"2","key":"1007_CR12","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/TPDS.2008.74","volume":"20","author":"D Kim","year":"2009","unstructured":"Kim, D., Yiwei, W., Li, Y., Zou, F., Ding-Zhu, D.: Constructing minimum connected dominating sets with bounded diameters in wireless networks. IEEE Trans. Parallel Distrib. Syst. 20(2), 147\u2013157 (2009)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"1007_CR13","doi-asserted-by":"crossref","unstructured":"Liu, Q., Zhang, Z., Hong, Y., Wu, W., Du, D.-Z.: A PTAS for weak minimum routing cost connected dominating set of unit disk graph. In: Chinchuluun, A. et al. (eds.) Optimization, Simulation, and Control. Springer Optimization and Its Applications, vol. 76, pp. 131\u2013142 (2013)","DOI":"10.1007\/978-1-4614-5131-0_9"},{"issue":"4","key":"1007_CR14","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1007\/s10878-010-9372-0","volume":"23","author":"W Ma","year":"2012","unstructured":"Ma, W., Li, D., Zhang, Z.: Algorithms for the minimum weight $$k$$ k -fold (connected) dominating set problem. J. Comb. Optim. 23(4), 528\u2013540 (2012)","journal-title":"J. Comb. Optim."},{"key":"1007_CR15","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF02559533","volume":"105","author":"N Oler","year":"1961","unstructured":"Oler, N.: An inequality in the geometry of numbers. Acta Math. 105, 19\u201348 (1961)","journal-title":"Acta Math."},{"key":"1007_CR16","doi-asserted-by":"crossref","unstructured":"Stojmenovic, I., Seddigh, M., Zunic, J.: Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. In: Proceedings of the IEEE Hawaii International Conference on System Sciences (2001)","DOI":"10.1109\/HICSS.2001.927199"},{"issue":"3","key":"1007_CR17","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s11590-009-0151-8","volume":"4","author":"W Weili","year":"2010","unstructured":"Weili, W., Gao, X., Pardalos, P.M., Ding-Zhu, D.: Wireless networking, dominating and packing. Optim. Lett. 4(3), 347\u2013358 (2010)","journal-title":"Optim. Lett."},{"key":"1007_CR18","doi-asserted-by":"crossref","unstructured":"Willson, J., Gao, X., Qu, Z., Zhu, Y., Li, Y., Wu, W.: Efficient distributed algorithms for topology control problem with shortest path constraints. Discrete Math. Algorithm Appl. 1(4), 437\u2013462 (2009)","DOI":"10.1142\/S1793830909000348"},{"key":"1007_CR19","doi-asserted-by":"crossref","unstructured":"Wu, J., Li, H.: On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proceedings of the 3rd ACM International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 7\u201314 (1999)","DOI":"10.1145\/313239.313261"},{"issue":"1","key":"1007_CR20","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/s10878-013-9638-4","volume":"28","author":"J Zhou","year":"2014","unstructured":"Zhou, J., Zhang, Z., Weili, W., Xing, K.: A greedy algorithm for the fault-tolerant connected dominating set in a general graph. J. Comb. Optim. 28(1), 310\u2013319 (2014)","journal-title":"J. Comb. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1007-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1007-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1007-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:44Z","timestamp":1559409104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1007-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,29]]},"references-count":20,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["1007"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1007-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,29]]}}}