{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:55:19Z","timestamp":1774418119704,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642174575","type":"print"},{"value":"9783642174582","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17458-2_21","type":"book-chapter","created":{"date-parts":[[2010,12,15]],"date-time":"2010-12-15T11:12:57Z","timestamp":1292411577000},"page":"252-259","source":"Crossref","is-referenced-by-count":18,"title":["PTAS for Minimum Connected Dominating Set with Routing Cost Constraint in Wireless Sensor Networks"],"prefix":"10.1007","author":[{"given":"Hongwei","family":"Du","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jioafei","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuexuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wonjun","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haesun","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Bharghavan, V., Das, B.: Routing in ad hoc networks using minimum connected dominating sets. In: International Conference on Communication, Montreal, Canada (June 1997)"},{"key":"21_CR2","unstructured":"Cardei, M., Cheng, M.X., Cheng, X., Du, D.-Z.: Connected domination in ad hoc wireless networks. In: Proc. the Sixth International Conference on Computer Science and Informatics (CS&I 2002) (2002)"},{"key":"21_CR3","doi-asserted-by":"publisher","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\u00a042, 202\u2013208 (2003)","journal-title":"Networks"},{"key":"21_CR4","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. To appear in the 30th International Conference on Distributed Computing Systems, ICDCS 2010 (2010)","DOI":"10.1109\/ICDCS.2010.17"},{"key":"21_CR5","unstructured":"Du, H., Ding, L., Wu, W., Willson, J., Lee, W., Du, D.-Z.: Approximation for minimum vitual backbone with routing cost constraint in wireless networks (manuscript)"},{"key":"21_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), San Francisco, USA, January 20-22, pp. 167\u2013175 (2008)"},{"key":"21_CR7","doi-asserted-by":"publisher","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\u00a020, 374\u2013387 (1998)","journal-title":"Algorithmica"},{"key":"21_CR8","unstructured":"Liu, Q., Zhang, Z., Willson, J., Ding, L., Wu, W., Lee, W., Du, D.-Z.: Approximation for minimum connected dominating set with routing cost constraint in unit disk graphs (manuscript)"},{"key":"21_CR9","doi-asserted-by":"publisher","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, K.-I.: A greedy approximation for minimum connected dominating set. Theoretical Computer Science\u00a0329, 325\u2013330 (2004)","journal-title":"Theoretical Computer Science"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Salhieh, A., Weinmann, J., Kochha, M., Schwiebert, L.: Power Efficient topologies for wireless sensor networks. In: ICPP 2001, pp.156\u2013163 (2001)","DOI":"10.1109\/ICPP.2001.952059"},{"key":"21_CR11","unstructured":"Sivakumar, R., Das, B., Bharghavan, V.: An improved spine-based infrastructure for routing in ad hoc networks. In: IEEE Symposium on Computer and Communications, Athens, Greece (June 1998)"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Stojmenovic, I., Seddigh, M., Zunic, J.: Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. In: Proc. IEEE Hawaii Int. Conf. on System Sciences (January 2001)","DOI":"10.1109\/71.980024"},{"key":"21_CR13","unstructured":"Willson, J., Gao, X., Qu, Z., Zhu, Y., Li, Y., Wu, W.: Efficient Distributed Algorithms for Topology Control Problem with Shortest Path Constraints (submitted)"},{"key":"21_CR14","unstructured":"Wan, P., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. In: Proc. 3rd ACM Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 7\u201314 (1999)"},{"key":"21_CR15","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"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17458-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T02:57:24Z","timestamp":1559876244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17458-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174575","9783642174582"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17458-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}