{"id":"https://openalex.org/W3041620247","doi":"https://doi.org/10.1145/3350755.3400217","title":"A LOCAL Constant Approximation Factor Algorithm for Minimum Dominating Set of Certain Planar Graphs","display_name":"A LOCAL Constant Approximation Factor Algorithm for Minimum Dominating Set of Certain Planar Graphs","publication_year":2020,"publication_date":"2020-07-06","ids":{"openalex":"https://openalex.org/W3041620247","doi":"https://doi.org/10.1145/3350755.3400217","mag":"3041620247"},"language":"en","primary_location":{"id":"doi:10.1145/3350755.3400217","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3350755.3400217","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041521633","display_name":"Sharareh Alipour","orcid":"https://orcid.org/0000-0002-3626-8960"},"institutions":[{"id":"https://openalex.org/I4210146419","display_name":"Institute for Research in Fundamental Sciences","ror":"https://ror.org/04xreqs31","country_code":"IR","type":"facility","lineage":["https://openalex.org/I4210146419"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Sharareh Alipour","raw_affiliation_strings":["Institute for Research in Fundamental Sciences (IPM), Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Institute for Research in Fundamental Sciences (IPM), Tehran, Iran","institution_ids":["https://openalex.org/I4210146419"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100744823","display_name":"Amir Jafari","orcid":"https://orcid.org/0000-0001-9084-9566"},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Amir Jafari","raw_affiliation_strings":["Sharif University of Technology, Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041521633"],"corresponding_institution_ids":["https://openalex.org/I4210146419"],"apc_list":null,"apc_paid":null,"fwci":0.8443,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.78920406,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"501","last_page":"502"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.8028297424316406},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7609668970108032},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.583056628704071},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5814636945724487},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5321720242500305},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.5201714038848877},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4836067259311676},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4698813259601593},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4674074947834015},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.46706920862197876},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4380028545856476},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3790878653526306},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2993715703487396},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2760258913040161},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.20165425539016724},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1713709533214569}],"concepts":[{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.8028297424316406},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7609668970108032},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.583056628704071},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5814636945724487},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5321720242500305},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.5201714038848877},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4836067259311676},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4698813259601593},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4674074947834015},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.46706920862197876},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4380028545856476},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3790878653526306},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2993715703487396},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2760258913040161},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.20165425539016724},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1713709533214569},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3350755.3400217","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3350755.3400217","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1982471320","https://openalex.org/W2045385016","https://openalex.org/W2048769918","https://openalex.org/W2138623498","https://openalex.org/W2567427072"],"related_works":["https://openalex.org/W2952723382","https://openalex.org/W4301177232","https://openalex.org/W2155984879","https://openalex.org/W1483891445","https://openalex.org/W2388345276","https://openalex.org/W2391238671","https://openalex.org/W1530712874","https://openalex.org/W3047117384","https://openalex.org/W4242849573","https://openalex.org/W2007607373"],"abstract_inverted_index":{"In":[0],"this":[1,31],"paper,":[2],"we":[3],"present":[4],"a":[5],"randomized":[6],"LOCAL":[7],"constant":[8],"approximation":[9,28],"factor":[10,29],"algorithm":[11,32],"for":[12,33,43],"minimum":[13,19],"dominating":[14,21],"set":[15,22],"(MDS)":[16],"problem":[17,24],"and":[18,41,45],"total":[20],"(MTDS)":[23],"in":[25],"graphs.":[26],"The":[27],"of":[30],"planar":[34],"graphs":[35],"with":[36],"no":[37],"4-cycles":[38],"is":[39],"18":[40],"9":[42],"MDS":[44],"MTDS":[46],"problems,":[47],"respectively.":[48]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}