{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:20:12Z","timestamp":1761488412066},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240587"},{"type":"electronic","value":"9783540305385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30538-5_37","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:40:30Z","timestamp":1268401230000},"page":"447-459","source":"Crossref","is-referenced-by-count":26,"title":["Distributed Algorithms for Coloring and Domination in Wireless Ad\u00a0Hoc Networks"],"prefix":"10.1007","author":[{"given":"Srinivasan","family":"Parthasarathy","sequence":"first","affiliation":[]},{"given":"Rajiv","family":"Gandhi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Alzoubi, K.M.: Connected dominating set and its induced position-less sparse spanner for mobile ad hoc networks. In: Proceedings of the Eighth IEEE Symposium on Computers and Communications (June 2003)","DOI":"10.1109\/ISCC.2003.1214124"},{"key":"37_CR2","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1109\/JCN.2002.6596929","volume":"4","author":"K.M. Alzoubi","year":"2002","unstructured":"Alzoubi, K.M., Wan, P.-J., Frieder, O.: Distributed heuristics for connected dominating sets in wireless ad hoc networks. IEEE ComSoc\/KICS Journal on Communication Networks\u00a04, 22\u201329 (2002)","journal-title":"IEEE ComSoc\/KICS Journal on Communication Networks"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Alzoubi, K.M., Wan, P.-J., Frieder, O.: Message efficient construction of nontrivial connected dominating sets in wireless ad hoc networks. To appear in Special Issue of ACM Journal of Monet (2002)","DOI":"10.1145\/513819.513820"},{"key":"37_CR4","unstructured":"Alzoubi, K.M., Wan, P.-J., Frieder, O.: Message-optimal connected-dominating-set construction for routing in mobile ad hoc networks. In: Proceedings of the Third ACM International Symposium on Mobile Ad Hoc Networking and Computing (June 2002)"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Alzoubi, K.M., Wan, P.-J., Frieder, O.: New distributed algorithm for connected dominating set in wireless ad hoc networks. In: IEEE HICSS35 (2002)","DOI":"10.1109\/HICSS.2002.994519"},{"key":"37_CR6","unstructured":"Cheng, X., Huang, X., Li, D., Du, D.-Z.: Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Technical report"},{"key":"37_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B. Clark","year":"1990","unstructured":"Clark, B., Colbourn, C., Johnson, D.: Unit disk graphs. Discrete Mathematics\u00a086, 165\u2013177 (1990)","journal-title":"Discrete Mathematics"},{"key":"37_CR8","unstructured":"Das, B., Sivakumar, R., Bharghavan, V.: Routing in ad-hoc networks using a virtual backbone. In: 6th International Conference on Computer Communications and Networks IC3N 1997 (September 1997), pp. 1\u201320 (1997)"},{"key":"37_CR9","first-page":"376","volume":"1","author":"B. Das","year":"1997","unstructured":"Das, B., Bharghavan, V.: Routing in ad-hoc networks using minimum connected dominating sets. ICC\u00a01, 376\u2013380 (1997)","journal-title":"ICC"},{"key":"37_CR10","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1145\/778415.778442","volume-title":"Proceedings of the fourth ACM international symposium on Mobile ad hoc networking and computing","author":"R. Gandhi","year":"2003","unstructured":"Gandhi, R., Parthasarathy, S., Mishra, A.: Minimizing broadcast latency and redundancy in ad hoc networks. In: Proceedings of the fourth ACM international symposium on Mobile ad hoc networking and computing, pp. 222\u2013232. ACM Press, New York (2003)"},{"issue":"2","key":"37_CR11","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1109\/18.825799","volume":"46","author":"P. Gupta","year":"2000","unstructured":"Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Transactions on Information Theory\u00a046(2), 388\u2013404 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"37_CR12","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1023\/A:1012311216333","volume":"7","author":"S.O. Krumke","year":"2001","unstructured":"Krumke, S.O., Marathe, M.V., Ravi, S.S.: Models and approximation algorithms for channel assignment in radio networks. Wireless Networks\u00a07(6), 575\u2013584 (2001)","journal-title":"Wireless Networks"},{"key":"37_CR13","unstructured":"Anil Kumar, V.S., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: End-to-End Packet Scheduling in Ad Hoc Networks. To appear in ACM SODA (2004)"},{"issue":"4","key":"37_CR14","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M. Luby","year":"1986","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing\u00a015(4), 1036\u20131053 (1986)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"37_CR15","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/0022-0000(93)90033-S","volume":"47","author":"M. Luby","year":"1993","unstructured":"Luby, M.: Removing randomness in parallel computation without a processor penalty. Journal of Computer and System Sciences\u00a047(2), 250\u2013286 (1993)","journal-title":"Journal of Computer and System Sciences"},{"key":"37_CR16","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":"2","key":"37_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1023\/A:1019126406181","volume":"5","author":"S. Ramanathan","year":"1999","unstructured":"Ramanathan, S.: A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks\u00a05(2), 81\u201394 (1999)","journal-title":"Wireless Networks"},{"issue":"2","key":"37_CR18","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1109\/90.222924","volume":"1","author":"S. Ramanathan","year":"1993","unstructured":"Ramanathan, S., Lloyd, E.L.: Scheduling algorithms for multihop radio networks. IEEE\/ACM Transactions on Networking (TON)\u00a01(2), 166\u2013177 (1993)","journal-title":"IEEE\/ACM Transactions on Networking (TON)"},{"key":"37_CR19","unstructured":"Sen, A., Melesinska, E.: On approximation algorithms for radio network scheduling. In: Proceedings of the 35th Allerton Conference on Communication, Control and Computing, pp. 573\u2013582 (1997)"},{"key":"37_CR20","unstructured":"Sivakumar, R., Das, B., Bharghavan, V.: Spine routing in ad hoc networks. ACM\/Baltzer Cluster Computing Journal (special issue on Mobile Computing) (1998)"},{"key":"37_CR21","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Alzoubi, K., Frieder, O.: Distributed construction of connnected dominating set in wireless ad hoc networks. In: IEEE INFOCOM (2002)","DOI":"10.1145\/513819.513820"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30538-5_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:58:55Z","timestamp":1605761935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30538-5_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240587","9783540305385"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30538-5_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}