{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:38Z","timestamp":1759638518833,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540922209"},{"type":"electronic","value":"9783540922216"}],"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-92221-6_31","type":"book-chapter","created":{"date-parts":[[2008,12,3]],"date-time":"2008-12-03T08:25:04Z","timestamp":1228292704000},"page":"496-511","source":"Crossref","is-referenced-by-count":14,"title":["A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence"],"prefix":"10.1007","author":[{"given":"Sayaka","family":"Kamei","sequence":"first","affiliation":[]},{"given":"Hirotsugu","family":"Kakugawa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"31_CR1","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(1-3), 165\u2013177 (1990)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"31_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/311531.311532","volume":"31","author":"F.C. G\u00e4rtner","year":"1999","unstructured":"G\u00e4rtner, F.C.: Fundamentals of fault-tolerant distributed computing in asynchronous environments. ACM Computing Surveys\u00a031(1), 1\u201326 (1999)","journal-title":"ACM Computing Surveys"},{"issue":"11","key":"31_CR3","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E.W. Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM\u00a017(11), 643\u2013644 (1974)","journal-title":"Communications of the ACM"},{"key":"31_CR4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-Stabilization","author":"S. Dolev","year":"2000","unstructured":"Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Kakuagwa, H., Masuzawa, T.: A self-stabilizing minimal dominating set algorithm with safe convergence. In: Proceedings IPDPS Workshop on Advances on Parallel and Distributed Computational Model (APDCM), p. 263 (2006)","DOI":"10.1109\/IPDPS.2006.1639550"},{"issue":"4","key":"31_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/cjtcs.1997.004","volume":"3","author":"S. Dolev","year":"1997","unstructured":"Dolev, S., Herman, T.: Superstabilizing protocols for dynamic distributed systems. Chicago Journal of Theoretical Computer Science\u00a03(4), 1\u201340 (1997)","journal-title":"Chicago Journal of Theoretical Computer Science"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-45032-7_10","volume-title":"Self-Stabilizing Systems","author":"S. Ghosh","year":"2003","unstructured":"Ghosh, S., Bejan, A.: A framework of safe stabilization. In: Huang, S.-T., Herman, T. (eds.) SSS 2003. LNCS, vol.\u00a02704, pp. 129\u2013140. Springer, Heidelberg (2003)"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1006\/jpdc.2001.1830","volume":"62","author":"J.A. Cobb","year":"2002","unstructured":"Cobb, J.A., Gouda, M.G.: Stabilization of general loop-free routing. Journal of Parallel and Distributed Computing\u00a062, 922\u2013944 (2002)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-45032-7_14","volume-title":"Self-Stabilizing Systems","author":"C. Johnen","year":"2003","unstructured":"Johnen, C., Tixeuil, S.: Routing preserving stabilization. In: Huang, S.-T., Herman, T. (eds.) SSS 2003. LNCS, vol.\u00a02704, pp. 184\u2013198. Springer, Heidelberg (2003)"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Kamei, S., Kakugawa, H.: A self-stabilizing approximation algorithm for the minimum weakly connected dominating set with safe convergence. In: Proceedings of the 1st International Workshop on Reliability, Availability, and Security (WRAS), pp. 57\u201366 (2007)","DOI":"10.1109\/IPDPS.2007.370464"},{"key":"31_CR11","first-page":"329","volume-title":"Handbook of Combinatorial Optimization","author":"J. Blum","year":"2004","unstructured":"Blum, J., Ding, M., Thaeler, A., Cheng, X.: Connected dominating set in sensor networks and MANETs. In: Handbook of Combinatorial Optimization, pp. 329\u2013369. Kluwer Academic Publishers, Dordrecht (2004)"},{"issue":"2","key":"31_CR12","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1002\/wcm.109","volume":"3","author":"J. Wu","year":"2003","unstructured":"Wu, J., Lou, W.: Forward-node-set-based broadcast in clustered mobile ad hoc networks. Wireless Networks and Mobile Computing\u00a03(2), 155\u2013173 (2003)","journal-title":"Wireless Networks and Mobile Computing"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1002\/dac.726","volume":"18","author":"B. Gao","year":"2005","unstructured":"Gao, B., Yang, Y., Ma, H.: A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks. International Journal of Communication System\u00a018, 743\u2013762 (2005)","journal-title":"International Journal of Communication System"},{"key":"31_CR14","unstructured":"Cheng, X., Du, D.Z.: Virtual backbone-based routing in multihop ad hoc wireless networks. Technical report, University of Minnesota (2002)"},{"issue":"2","key":"31_CR15","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/B:MONE.0000013625.87793.13","volume":"9","author":"P.J. Wan","year":"2004","unstructured":"Wan, P.J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. Mobile Networks and Applications\u00a09(2), 141\u2013149 (2004)","journal-title":"Mobile Networks and Applications"},{"key":"31_CR16","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., Jia, X., Huang, C.X., Huang, S.C.H., Wu, W.: 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":"31_CR17","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1002\/wcm.356","volume":"5","author":"Y. Li","year":"2005","unstructured":"Li, Y., Thai, M.T., Wang, F., Yi, C.W., Wan, P.J., Du, D.X.: On greedy construction of connected dominating sets in wireless networks. Wireless Communications and Mobile Computing\u00a05, 927\u2013932 (2005)","journal-title":"Wireless Communications and Mobile Computing"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Jain, A., Gupta, A.: A distributed self-stabilizing algorithm for finding a connected dominating set in a graph. In: Proceedings of the 6th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT), pp. 615\u2013619 (2005)","DOI":"10.1109\/PDCAT.2005.10"},{"key":"31_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/11945529_30","volume-title":"Principles of Distributed Systems","author":"V. Drabkin","year":"2006","unstructured":"Drabkin, V., Friedman, R., Gradinariu, M.: Self-stabilizing wireless connected overlays. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol.\u00a04305, pp. 425\u2013439. Springer, Heidelberg (2006)"},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"Kamei, S., Kakugawa, H.: A self-stabilizing distributed approximation algorithm for the minimum connected dominating set. In: Proceedings of the 9th IPDPS Workshop on Advances in Parallel and Distributed Computational Models (APDCM), p. 224 (2007)","DOI":"10.1109\/IPDPS.2007.370464"},{"key":"31_CR21","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"},{"issue":"5","key":"31_CR22","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0020-0190(95)00050-M","volume":"54","author":"T. Herman","year":"1995","unstructured":"Herman, T., Ghosh, S.: Stabilizing phase-clocks. Information Processing Letters\u00a054(5), 259\u2013265 (1995)","journal-title":"Information Processing Letters"},{"key":"31_CR23","unstructured":"Berge, C.: Theory of Graphs and its Applications. Methuen (1962)"},{"issue":"1","key":"31_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2005.08.037","volume":"352","author":"W. Wu","year":"2006","unstructured":"Wu, W., Du, H., Jia, X., Li, Y., Huang, S.C.H.: Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theoretical Computer Science\u00a0352(1), 1\u20137 (2006)","journal-title":"Theoretical Computer Science"},{"key":"31_CR25","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1109\/12.312126","volume":"43","author":"A. Arora","year":"1994","unstructured":"Arora, A., Gouda, M.: Distributed reset. IEEE Transactions on Computers\u00a043, 1026\u20131038 (1994)","journal-title":"IEEE Transactions on Computers"},{"issue":"4","key":"31_CR26","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1109\/71.588622","volume":"8","author":"S. Dolev","year":"1997","unstructured":"Dolev, S., Israeli, A., Moran, S.: Uniform dynamic self-stabilizing leader election. IEEE Transactions on Parallel and Distributed Systems\u00a08(4), 424\u2013440 (1997)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"7","key":"31_CR27","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1109\/TPDS.2007.70792","volume":"19","author":"A. Derhab","year":"2008","unstructured":"Derhab, A., Badache, N.: A self-stabilizing leader election algorithm in highly dynamic ad hoc mobile network. IEEE Transacctions on Parallel and Distributed Systems\u00a019(7), 926\u2013939 (2008)","journal-title":"IEEE Transacctions on Parallel and Distributed Systems"},{"issue":"5-6","key":"31_CR28","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/j.camwa.2005.05.002","volume":"50","author":"T.C. Huang","year":"2005","unstructured":"Huang, T.C.: A self-stabilizing algorithm for the shortest path problem assuming the distributed demon. Computers and Mathematics with Applications\u00a050(5-6), 671\u2013681 (2005)","journal-title":"Computers and Mathematics with Applications"},{"issue":"5-6","key":"31_CR29","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1016\/S0898-1221(03)90143-X","volume":"46","author":"S.M. Hedetniemi","year":"2003","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Self-stabilizing algorithms for minimal dominating sets and maximal independent sets. Computers and Mathematics with Applications\u00a046(5-6), 805\u2013811 (2003)","journal-title":"Computers and Mathematics with Applications"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92221-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T02:25:58Z","timestamp":1738722358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92221-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540922209","9783540922216"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92221-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}