{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:37:16Z","timestamp":1757313436069,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"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":[[2020,7,6]]},"DOI":"10.1145\/3350755.3400217","type":"proceedings-article","created":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T15:56:12Z","timestamp":1594310172000},"page":"501-502","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["A LOCAL Constant Approximation Factor Algorithm for Minimum Dominating Set of Certain Planar Graphs"],"prefix":"10.1145","author":[{"given":"Sharareh","family":"Alipour","sequence":"first","affiliation":[{"name":"Institute for Research in Fundamental Sciences (IPM), Tehran, Iran"}]},{"given":"Amir","family":"Jafari","sequence":"additional","affiliation":[{"name":"Sharif University of Technology, Tehran, Iran"}]}],"member":"320","published-online":{"date-parts":[[2020,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"22nd International Symposium, DISC 2008, Arcachon, France, September 22--24, 2008. Proceedings. 78--92","author":"Czygrinow Andrzej","year":"2008","unstructured":"Andrzej Czygrinow , Michal Hanckowiak , and Wojciech Wawrzyniak . 2008 . Fast Distributed Approximations in Planar Graphs. In Distributed Computing , 22nd International Symposium, DISC 2008, Arcachon, France, September 22--24, 2008. Proceedings. 78--92 . https:\/\/doi.org\/10.1007\/978--3--540--87779-0_6 10.1007\/978--3--540--87779-0_6 Andrzej Czygrinow, Michal Hanckowiak, and Wojciech Wawrzyniak. 2008. Fast Distributed Approximations in Planar Graphs. In Distributed Computing, 22nd International Symposium, DISC 2008, Arcachon, France, September 22--24, 2008. Proceedings. 78--92. https:\/\/doi.org\/10.1007\/978--3--540--87779-0_6"},{"key":"e_1_3_2_1_2_1","volume-title":"ACM Symposium on Principles of Distributed Computing, PODC '14","author":"Hilke Miikka","year":"2014","unstructured":"Miikka Hilke , Christoph Lenzen , and Jukka Suomela . 2014 . Local approximability of minimum dominating set on planar graphs . In ACM Symposium on Principles of Distributed Computing, PODC '14 , Paris, France, July 15--18 , 2014. 344--346. https:\/\/doi.org\/10.1145\/2611462.2611504 10.1145\/2611462.2611504 Miikka Hilke, Christoph Lenzen, and Jukka Suomela. 2014. Local approximability of minimum dominating set on planar graphs. In ACM Symposium on Principles of Distributed Computing, PODC '14, Paris, France, July 15--18, 2014. 344--346. https:\/\/doi.org\/10.1145\/2611462.2611504"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-013-0186-z"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2431211.2431223"},{"key":"e_1_3_2_1_5_1","volume-title":"ACM Symposium on Principles of Distributed Computing, PODC '13","author":"Wawrzyniak Wojciech","year":"2013","unstructured":"Wojciech Wawrzyniak . 2013 . A local approximation algorithm for MDS problem in anonymous planar networks . In ACM Symposium on Principles of Distributed Computing, PODC '13 , Montreal, QC, Canada, July 22--24 , 2013. 406--408. https:\/\/doi.org\/10.1145\/2484239.2484281 10.1145\/2484239.2484281 Wojciech Wawrzyniak. 2013. A local approximation algorithm for MDS problem in anonymous planar networks. In ACM Symposium on Principles of Distributed Computing, PODC '13, Montreal, QC, Canada, July 22--24, 2013. 406--408. https:\/\/doi.org\/10.1145\/2484239.2484281"}],"event":{"name":"SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Virtual Event USA","acronym":"SPAA '20"},"container-title":["Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400217","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3350755.3400217","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:35Z","timestamp":1750202015000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,6]]},"references-count":5,"alternative-id":["10.1145\/3350755.3400217","10.1145\/3350755"],"URL":"https:\/\/doi.org\/10.1145\/3350755.3400217","relation":{},"subject":[],"published":{"date-parts":[[2020,7,6]]},"assertion":[{"value":"2020-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}