{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:23:12Z","timestamp":1777890192217,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540885818","type":"print"},{"value":"9783540885825","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-88582-5_12","type":"book-chapter","created":{"date-parts":[[2008,10,15]],"date-time":"2008-10-15T01:28:50Z","timestamp":1224034130000},"page":"96-108","source":"Crossref","is-referenced-by-count":8,"title":["New Approximation for Minimum-Weight Routing Backbone in Wireless Sensor Network"],"prefix":"10.1007","author":[{"given":"Ning","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Incheol","family":"Shin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cem","family":"Boyaci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Tiwari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"My T.","family":"Thai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Tatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum, NewYork (1972)"},{"key":"12_CR2","volume-title":"Computers and Intractability. A guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A guide to the Theory of NP-completeness. Freeman, New York (1979)"},{"key":"12_CR3","unstructured":"Leiserson, C.E., Rivest, R.L., Cormen, T.H., Stein, C.: Introduction to Algorithms. MIT Press and McGraw-Hill Book Company (1976)"},{"key":"12_CR4","volume-title":"Wireless communications: principles and practice","author":"T.S. Rappaport","year":"1996","unstructured":"Rappaport, T.S.: Wireless communications: principles and practice. Prentice-Hall, Englewood Cliffs (1996)"},{"key":"12_CR5","unstructured":"Kim, B., Yang, J., Zhou, D., Sun, M.: Energy-Aware Connected Dominating Set Construction in Mobile Ad Hoc Networks. In: Proc. 14th International Conference on Computer Communications and Networks, pp. 229\u2013234 (2005)"},{"issue":"1","key":"12_CR6","first-page":"1","volume":"4","author":"J. Wu","year":"2002","unstructured":"Wu, J., Dai, F., Gao, M., Stojmenovic, I.: On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks. Journal of Communications and Networks\u00a04(1), 1\u201312 (2002)","journal-title":"Journal of Communications and Networks"},{"key":"12_CR7","unstructured":"Agarwal, M., Cho, J.H., Gao, L., Wu, J.: On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks. In: Proc. of the 3rd Int\u2019l Workshop on Discrete Algorithms and Methods for Mobile Computing and Commun., pp. 7\u201314 (1999)"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/11830924_3","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"C. Amb\u00fchl","year":"2006","unstructured":"Amb\u00fchl, C., Erlebach, T., Mihal\u00e1k, M., Nunkesser, M.: Constant-factor Approximation for Minimum-weight (Connected) Dominating Sets in Unit Disk Graphs. In: D\u00edaz, J., Jansen, K., Rolim, J., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol.\u00a04110, pp. 3\u201314. Springer, Heidelberg (2006)"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0020-0190(93)90072-H","volume":"47","author":"E.M. Arkin","year":"1993","unstructured":"Arkin, E.M., Halldorssom, M.M., Hassin, R.: Approximating the tree and tour covers of a graph. Inform. Process. Lett.\u00a047, 275\u2013282 (1993)","journal-title":"Inform. Process. Lett."},{"issue":"6","key":"12_CR10","doi-asserted-by":"publisher","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. Inform. Process. Lett.\u00a079(6), 261\u2013266 (2001)","journal-title":"Inform. Process. Lett."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Fujito, T.: How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover. In: ICALP (1), pp. 431\u2013442 (2006)","DOI":"10.1007\/11786986_38"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jagm.1999.1042","volume":"33","author":"M. Charikar","year":"1999","unstructured":"Charikar, M., Chekuri, C., Cheung, T., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation Algorithms for Directed Steiner Tree Problems. Journal of Algorithms\u00a033, 73\u201391 (1999)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R.G. Gallager","year":"1983","unstructured":"Gallager, R.G., Humblet, P.A., Spira, P.M.: A Distributed Algorithm for Minimum-Weight Spanning Trees. ACM TOPLAS\u00a05(1), 66\u201377 (1983)","journal-title":"ACM TOPLAS"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Lindgren, A., Doria, A., Schelen, O.: Poster Probabilistic routing in intermittently connected networks. In: Proc. MobiHoc 2003 (June 2003)","DOI":"10.1145\/961268.961272"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Jain, S., Fall, K., Patra, R.: Routing in a delay tolerant network. In: Proc. ACM SIGCOMM 2004 (September 2004)","DOI":"10.1145\/1015467.1015484"},{"key":"12_CR16","unstructured":"Ghosh, J., Ngo, H.Q., Yoon, S., Qiao, C.: On a Routing Problem within Probabilistic Graph. In: Proc. INFOCOM 2007 (May 2007)"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88582-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T17:08:10Z","timestamp":1557853690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88582-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540885818","9783540885825"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88582-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}