{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:37:11Z","timestamp":1750307831771,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,5,26]],"date-time":"2008-05-26T00:00:00Z","timestamp":1211760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,5,26]]},"DOI":"10.1145\/1374718.1374720","type":"proceedings-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T16:50:20Z","timestamp":1211993420000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Trade-off scheme for fault tolerant connected dominating sets on size and diameter"],"prefix":"10.1145","author":[{"given":"Ning","family":"Zhang","sequence":"first","affiliation":[{"name":"University of Florida, Gainesville, FL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Incheol","family":"Shin","sequence":"additional","affiliation":[{"name":"University of Florida, Gainesville, FL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Zou","sequence":"additional","affiliation":[{"name":"University of Texas - Dallas, Richardson, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[{"name":"University of Texas - Dallas, Richardson, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"My Tra","family":"Thai","sequence":"additional","affiliation":[{"name":"University of Florida, Gainesville, FL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,5,26]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"A guide to the Theory of NP-completeness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey , D. S. Johnson , \"Computers and Intractability. A guide to the Theory of NP-completeness \", Freeman , New York , 1979 . M. R. Garey, D. S. Johnson, \"Computers and Intractability. A guide to the Theory of NP-completeness\", Freeman, New York, 1979."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/313451.313525"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2007.1034"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the Conference of the IEEE Communications Society (INFOCOM)","author":"Wan P.-J.","year":"2002","unstructured":"P.-J. Wan , K. M. Alzoubi , and O. Frieder , \" Distributed Construction on Connected Dominating Set in Wireless ad hoc Networks \", Proceedings of the Conference of the IEEE Communications Society (INFOCOM) , 2002 . P.-J. Wan, K. M. Alzoubi, and O. Frieder, \"Distributed Construction on Connected Dominating Set in Wireless ad hoc Networks\", Proceedings of the Conference of the IEEE Communications Society (INFOCOM), 2002."},{"key":"e_1_3_2_1_5_1","volume-title":"NSF International Workshop on Thoretical Aspects of Wireless ad hoc, Sensor and Peer-to-Peer Networks","author":"Li Y.","year":"2004","unstructured":"Y. Li , S. Zhu , M. T. Thai , and D.-Z. Du , \"Localized Construction of Connected Dominating Set in Wireless Networks\" , NSF International Workshop on Thoretical Aspects of Wireless ad hoc, Sensor and Peer-to-Peer Networks , 2004 . Y. Li, S. Zhu, M. T. Thai, and D.-Z. Du, \"Localized Construction of Connected Dominating Set in Wireless Networks\", NSF International Workshop on Thoretical Aspects of Wireless ad hoc, Sensor and Peer-to-Peer Networks, 2004."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1997.605303"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2006.52"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCIMA.2005.33"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/WASA.2007.148"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2006.154"},{"key":"e_1_3_2_1_11_1","volume-title":"Techmical report FIMU-RS-2001-01","author":"Brim L.","year":"2001","unstructured":"L. Brim , I. Cerna , P. Krcal and R. Pelanek , \" Distributed shortest paths for directed graphs with negative edge lengths \", Techmical report FIMU-RS-2001-01 , Faculty of Informatics, Masaryk University , http:\/\/www.fi.muni.cz\/informatics\/reports, 2001 . L. Brim, I. Cerna, P. Krcal and R. Pelanek, \"Distributed shortest paths for directed graphs with negative edge lengths\", Techmical report FIMU-RS-2001-01, Faculty of Informatics, Masaryk University, http:\/\/www.fi.muni.cz\/informatics\/reports, 2001."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/75427.75463"},{"key":"e_1_3_2_1_13_1","volume-title":"Introduction to Algorithms\"?","author":"Leiserson C. E.","year":"1976","unstructured":"C. E. Leiserson , R. L. Rivest , T. H. Cormen and C. Stein , \" Introduction to Algorithms\"? , MIT Press and McGraw-Hill Book Company , 1976 . C. E. Leiserson, R. L. Rivest, T. H. Cormen and C. Stein, \"Introduction to Algorithms\"?, MIT Press and McGraw-Hill Book Company, 1976."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2007.4454774"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.05.025"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2009.051053"}],"event":{"name":"MobiHoc08: The Ninth ACM International Symposium on Mobile Ad Hoc Networking and Computing","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing","ACM Association for Computing Machinery"],"location":"Hong Kong Hong Kong, China","acronym":"MobiHoc08"},"container-title":["Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374718.1374720","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1374718.1374720","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:56Z","timestamp":1750255076000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374718.1374720"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,26]]},"references-count":16,"alternative-id":["10.1145\/1374718.1374720","10.1145\/1374718"],"URL":"https:\/\/doi.org\/10.1145\/1374718.1374720","relation":{},"subject":[],"published":{"date-parts":[[2008,5,26]]},"assertion":[{"value":"2008-05-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}