{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:31:45Z","timestamp":1742945505288,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926809"},{"type":"electronic","value":"9783030926816"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92681-6_41","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"527-537","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Algorithm for\u00a0Minimum Partial Dominating Set in\u00a0Unit Disk Graph"],"prefix":"10.1007","author":[{"given":"Weizhi","family":"Hong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingli","family":"Ran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"issue":"1","key":"41_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(84)90086-6","volume":"9","author":"R Bar-Yehuda","year":"1984","unstructured":"Bar-Yehuda, R., Moran, S.: On approximation problems related to the independent set and vertex cover problem. Disc. Appl. Math. 9(1), 1\u201310 (1984)","journal-title":"Disc. Appl. Math."},{"issue":"3","key":"41_CR2","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1016\/S0022-0000(05)80068-6","volume":"49","author":"B Berger","year":"1994","unstructured":"Berger, B., Rompel, J., Shor, P.W.: Efficient NC algorithms for set cover with applications to learning and geometry. J. Comput. Syst. Sci. 49(3), 454\u2013477 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Grant, E.: Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 1576\u20131585. SIAM (2012)","DOI":"10.1137\/1.9781611973099.125"},{"issue":"1\u20133","key":"41_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Disc. Math. 86(1\u20133), 165\u2013177 (1990)","journal-title":"Disc. Math."},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Das, G.K., Fraser, R., Lopez-ortiz, A., Nickerson, B.G.: On the discrete unit disk cover problem. Int. J. Comput. Geometry Appl. 22(5), 407\u2013419 (2012)","DOI":"10.1142\/S0218195912500094"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Dinur, I., Steurer, D.: Analytical approach to parallel repetition. In: 46th Annual ACM Symposium on Theory of Computing, pp. 624\u2013633, New York (2014)","DOI":"10.1145\/2591796.2591884"},{"key":"41_CR7","doi-asserted-by":"publisher","unstructured":"Du, D.Z., Wang, P.J.: Connected Dominating Set: Theory and Applications. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-5242-3","DOI":"10.1007\/978-1-4614-5242-3"},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"Feige, U.: A threshold of ln $$n$$ for approximating set cover. In: 28th International Proceedings on ACM Symposium on Theory of Computing, pp. 314\u2013318. ACM, New York (1996)","DOI":"10.1145\/237814.237977"},{"issue":"3","key":"41_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"RJ Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Inf. Process. Lett. 12(3), 133\u2013137 (1981)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"41_CR10","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.jalgor.2004.04.002","volume":"53","author":"R Gandhi","year":"2004","unstructured":"Gandhi, R., Khuller, S., Srinivasan, A.: Approximation algorithms for partial covering problems. J. Algorithms 53(1), 55\u201384 (2004)","journal-title":"J. Algorithms"},{"key":"41_CR11","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co.Subs. of Scientific American, Inc. 41 Madison Avenue, 37th Fl. New York, NY, United States (1979)"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Haeupler, B.: A Time-optimal randomized parallel algorithm for MIS. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, pp. 2892\u20132903. SIAM (2021)","DOI":"10.1137\/1.9781611976465.172"},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"Gonzalez, T.F.: Covering a set of points in multidimensional space. Inf. Process. Lett. 40(4), 181\u2013188 (1991)","DOI":"10.1016\/0020-0190(91)90075-S"},{"key":"41_CR14","doi-asserted-by":"crossref","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32(1), 130\u2013136 (1985)","DOI":"10.1145\/2455.214106"},{"issue":"2","key":"41_CR15","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jagm.1997.0903","volume":"26","author":"HB Hunt III","year":"1998","unstructured":"Hunt, H.B., III., 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. J. Algorithms 26(2), 238\u2013274 (1998)","journal-title":"J. Algorithms"},{"key":"41_CR16","unstructured":"J\u00e1J\u00e1 J.: An Introduction to Parallel Algorithms. Addison Wesley Longman Publishing Co., Inc. 350 Bridge Pkwy suite 208 Redwood City, CA, United State (1992)"},{"key":"41_CR17","doi-asserted-by":"crossref","unstructured":"Joachim, K., Daniel, M., Peter, R.: Partial vs. complete domination: t-dominating set. In: International Conference on Current Trends in Theory and Practice of Computer Science, vol. 4362(1), pp. 367\u2013376 (2007)","DOI":"10.1007\/978-3-540-69507-3_31"},{"issue":"2","key":"41_CR18","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jagm.1994.1036","volume":"17","author":"S Khuller","year":"1994","unstructured":"Khuller, S., Vishkin, U., Young, N.: A primal-dual parallel approximation technique applied to weighted set and vertex covers. J. Algorithms 17(2), 280\u2013289 (1994)","journal-title":"J. Algorithms"},{"key":"41_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1007\/978-3-662-47672-7_73","volume-title":"Automata, Languages, and Programming","author":"J Li","year":"2015","unstructured":"Li, J., Jin, Y.: A PTAS for the weighted unit disk cover problem. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9134, pp. 898\u2013909. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47672-7_73"},{"key":"41_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/11671411_23","volume-title":"Approximation and Online Algorithms","author":"T Nieberg","year":"2006","unstructured":"Nieberg, T., Hurink, J.: A PTAS for the minimum dominating set problem in unit disk graphs. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 296\u2013306. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11671411_23"},{"key":"41_CR21","doi-asserted-by":"crossref","unstructured":"Ran, Y.L., Zhang, Y., Zhang, Z.: Parallel approximation for partial set cover. Appl. Math. Comput. 408, 126358 (2021)","DOI":"10.1016\/j.amc.2021.126358"},{"key":"41_CR22","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.jda.2015.05.002","volume":"33","author":"A Rashmisnata","year":"2015","unstructured":"Rashmisnata, A., Manjanna, B., Gautam, K.D.: Unit disk cover problem in 2D. J. Discrete Algorithms 33, 193\u2013201 (2015)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"41_CR23","first-page":"59","volume":"4","author":"J Wu","year":"2002","unstructured":"Wu, J., Dai, F., Gao, M., Stojmenovic, I.: On calculating power-aware connected dominating sets for efficient routing in Ad Hoc wireless networks. J. Commun. 4(1), 59\u201370 (2002)","journal-title":"J. Commun."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92681-6_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:07:55Z","timestamp":1639354075000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92681-6_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92681-6_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lxy.tjut.edu.cn\/COCOA2021\/COCOA_2021.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","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":"16","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":"8","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":"26% - 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":"4.2","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":"2.75","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)"}}]}}