{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:58:10Z","timestamp":1725519490636},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540885818"},{"type":"electronic","value":"9783540885825"}],"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_18","type":"book-chapter","created":{"date-parts":[[2008,10,14]],"date-time":"2008-10-14T21:28:50Z","timestamp":1224019730000},"page":"162-175","source":"Crossref","is-referenced-by-count":9,"title":["A Better Theoretical Bound to Approximate Connected Dominating Set in Unit Disk Graph"],"prefix":"10.1007","author":[{"given":"Xianyue","family":"Li","sequence":"first","affiliation":[]},{"given":"Xiaofeng","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B.S. Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for NP-complete Problems on Planar Graphs. Journal of the ACM\u00a041(1), 153\u2013180 (1994)","journal-title":"Journal of the ACM"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Blum, J., Ding, M., Thaeler, A., Cheng, X.Z.: Connected Dominating Set in Sensor Networks and MANETs. Handbook of Combinatorial Optimization, 329\u2013369 (2004)","DOI":"10.1007\/0-387-23830-1_8"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B.N. Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit Disk Graphs. Discrete Mathematics\u00a086, 165\u2013177 (1990)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"18_CR4","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1145\/1167935.1167941","volume":"2","author":"S. Funke","year":"2006","unstructured":"Funke, S., Kesselman, A., Meyer, U.: A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs. ACM Transactions on Sensor Networks\u00a02(3), 444\u2013453 (2006)","journal-title":"ACM Transactions on Sensor Networks"},{"issue":"1","key":"18_CR5","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI. Journal of the ACM\u00a032(1), 130\u2013136 (1985)","journal-title":"Journal of the ACM"},{"key":"18_CR6","unstructured":"Huang, G.T.: Casting the Wireless Sensor Net. Technology Review, 50\u201356 (2003)"},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jagm.1997.0903","volume":"26","author":"H.B. Hunt III","year":"1998","unstructured":"Hunt III, H.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: NC-Approximation Schemes for NP- and PSPACE-hard Problems for Geometric Graphs. Journal of Algorithms\u00a026(2), 238\u2013274 (1998)","journal-title":"Journal of Algorithms"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"M.V. Marathe","year":"1995","unstructured":"Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple Heuristics for Unit Disk Graphs. Networks\u00a025, 59\u201368 (1995)","journal-title":"Networks"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10898-005-8466-1","volume":"35","author":"M. Min","year":"2006","unstructured":"Min, M., Du, H.W., Jia, X.H., Huang, C.X., Huang, S.C., Wu, W.L.: Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks. Journal of Global Optimization\u00a035, 111\u2013119 (2006)","journal-title":"Journal of Global Optimization"},{"key":"18_CR10","unstructured":"Salem, H., Mohamed, N.: Middleware Challenges and Approaches for Wireless Sensor Networks. IEEE Distributed Systems Online\u00a07(3) (2006); art. no. 0603-o3001"},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1515\/crll.1908.134.198","volume":"134","author":"G.M. Voronoi","year":"1908","unstructured":"Voronoi, G.M.: Nouvelles applications des param\u00e8tres continus \u00e0 la th\u00e9orie des formes quadratiques. deuxi\u00e8me M\u00e9moire: Recherches sur les parall\u00e9llo\u00e8dres primitifs. J. Reine Angew. Math.\u00a0134, 198\u2013287 (1908)","journal-title":"J. Reine Angew. Math."},{"key":"18_CR12","unstructured":"Wan, P.J., Alzoubi, K.M., Frieder, O.: Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks. In: Proceedings of the Third ACM Internat. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 7\u201314 (1999)"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2005.08.037","volume":"352","author":"W.L. Wu","year":"2006","unstructured":"Wu, W.L., Du, H.W., Jia, X.H., Li, Y.S., Huang, S.C.: Minimum Connected Dominating Sets and Maximal Independent Sets in Unit Disk Graphs. Theorital Computer Science\u00a0352, 1\u20137 (2006)","journal-title":"Theorital Computer Science"}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,9]],"date-time":"2020-05-09T00:47:46Z","timestamp":1588985266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88582-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540885818","9783540885825"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88582-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}