{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:41:36Z","timestamp":1743090096387,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031221040"},{"type":"electronic","value":"9783031221057"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_45","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:36:12Z","timestamp":1672540572000},"page":"508-520","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Dominating Sets in Interval Graphs"],"prefix":"10.1007","author":[{"given":"Barun","family":"Gorain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaushik","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Supantha","family":"Pandit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Amiri, S.A., de Mendez, P.O., Rabinovich, R., Siebertz, S.: Distributed domination on graph classes of bounded expansion. In: SPAA, pp. 143\u2013151 (2018)","DOI":"10.1145\/3210377.3210383"},{"key":"45_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/wcm.378","volume":"6","author":"X Cheng","year":"2006","unstructured":"Cheng, X., Ding, M., Du, D.H., Jia, X.: Virtual backbone construction in multihop ad hoc wireless networks. Wirel. Commun. Mob. Comput. 6, 183\u2013190 (2006)","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"45_CR3","doi-asserted-by":"crossref","unstructured":"Das, B., Bharghavan, V.: Routing in ad-hoc networks using minimum connected dominating sets. In: ICC, pp. 376\u2013380 (1997)","DOI":"10.1109\/ICC.1997.605303"},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"Das, B., Sivakumar, R., Bharghavan, V.: Routing in ad hoc networks using a spine. In: ICCCN, pp. 34\u201341 (1997)","DOI":"10.1109\/ICCCN.1997.623288"},{"issue":"3","key":"45_CR5","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., Segal, M.: A simple improved distributed algorithm for minimum CDS in unit disk graphs. ACM Trans. Sens. Netw. 2(3), 444\u2013453 (2006)","journal-title":"ACM Trans. Sens. Netw."},{"key":"45_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"key":"45_CR7","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Kuhn, F., Maus, Y.: On the complexity of local distributed graph problems. In: STOC 2017, pp. 784\u2013797 (2017)","DOI":"10.1145\/3055399.3055471"},{"key":"45_CR8","doi-asserted-by":"crossref","unstructured":"Gorain, B., Mondal, K., Pandit, S.: Distributed independent sets in interval and segment intersection graphs. In: SOFSEM, pp. 175\u2013188 (2021)","DOI":"10.1007\/978-3-030-67731-2_13"},{"key":"45_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.jpdc.2017.01.023","volume":"104","author":"RK Jallu","year":"2017","unstructured":"Jallu, R.K., Prasad, P.R., Das, G.K.: Distributed construction of connected dominating set in unit disk graphs. J. Parallel Distrib. Comput. 104, 159\u2013166 (2017)","journal-title":"J. Parallel Distrib. Comput."},{"key":"45_CR10","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. IRSS, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: Local computation: lower and upper bounds. J. ACM 63, 17:1\u201317:44 (2016)","DOI":"10.1145\/2742012"},{"issue":"1","key":"45_CR12","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., Wu, W.: Improving construction for connected dominating set with Steiner tree in wireless sensor networks. J. Global Optimiz. 35(1), 111\u2013119 (2006)","journal-title":"J. Global Optimiz."},{"key":"45_CR13","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.jpdc.2019.05.012","volume":"132","author":"AR Molla","year":"2019","unstructured":"Molla, A.R., Pandit, S., Roy, S.: Optimal deterministic distributed algorithms for maximal independent set in geometric graphs. J. Parallel Distrib. Comput. 132, 36\u201347 (2019)","journal-title":"J. Parallel Distrib. Comput."},{"key":"45_CR14","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics (2000)","DOI":"10.1137\/1.9780898719772"},{"key":"45_CR15","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/71.980024","volume":"13","author":"I Stojmenovic","year":"2002","unstructured":"Stojmenovic, I., Seddigh, M., Zunic, J.D.: Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks. IEEE Trans. Parallel Distrib. Syst. 13, 14\u201325 (2002)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"45_CR16","doi-asserted-by":"crossref","unstructured":"Wan, P., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. In: INFOCOM, pp. 1597\u20131604 (2002)","DOI":"10.1145\/513800.513820"},{"key":"45_CR17","doi-asserted-by":"crossref","unstructured":"Wu, J., Li, H.: On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: DIAL-M, pp. 7\u201314 (1999)","DOI":"10.1145\/313239.313261"},{"issue":"1\u20133","key":"45_CR18","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.: Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theor. Comput. Sci. 352(1\u20133), 1\u20137 (2006)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22105-7_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T09:37:40Z","timestamp":1728639460000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}