{"id":"https://openalex.org/W2488232363","doi":"https://doi.org/10.1145/2933057.2933084","title":"A Local Constant Factor MDS Approximation for Bounded Genus Graphs","display_name":"A Local Constant Factor MDS Approximation for Bounded Genus Graphs","publication_year":2016,"publication_date":"2016-07-25","ids":{"openalex":"https://openalex.org/W2488232363","doi":"https://doi.org/10.1145/2933057.2933084","mag":"2488232363"},"language":"en","primary_location":{"id":"doi:10.1145/2933057.2933084","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2933057.2933084","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing","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/A5101665931","display_name":"Saeed Akhoondian Amiri","orcid":"https://orcid.org/0000-0002-7402-2662"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Saeed Akhoondian Amiri","raw_affiliation_strings":["Technical University Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Technical University Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066080641","display_name":"Stefan Schmid","orcid":"https://orcid.org/0000-0002-7798-1711"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]},{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE","DK"],"is_corresponding":false,"raw_author_name":"Stefan Schmid","raw_affiliation_strings":["Aalborg University, Denmark & TU Berlin, Germany, Aalborg, Denmark"],"affiliations":[{"raw_affiliation_string":"Aalborg University, Denmark & TU Berlin, Germany, Aalborg, Denmark","institution_ids":["https://openalex.org/I891191580","https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073548944","display_name":"Sebastian Siebertz","orcid":"https://orcid.org/0000-0002-6347-1198"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sebastian Siebertz","raw_affiliation_strings":["Technical University Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Technical University Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101665931"],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":null,"apc_paid":null,"fwci":3.2514,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.92485464,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"227","last_page":"233"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9983000159263611,"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"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.6581388115882874},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.639676034450531},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5717175602912903},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.563147783279419},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4908924698829651},{"id":"https://openalex.org/keywords/genus","display_name":"Genus","score":0.4523627460002899},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4318177103996277},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42973223328590393},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.41917213797569275},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4136594235897064},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2811877727508545},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07765740156173706}],"concepts":[{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.6581388115882874},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.639676034450531},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5717175602912903},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.563147783279419},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4908924698829651},{"id":"https://openalex.org/C157369684","wikidata":"https://www.wikidata.org/wiki/Q34740","display_name":"Genus","level":2,"score":0.4523627460002899},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4318177103996277},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42973223328590393},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41917213797569275},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4136594235897064},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2811877727508545},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07765740156173706},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C59822182","wikidata":"https://www.wikidata.org/wiki/Q441","display_name":"Botany","level":1,"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":2,"locations":[{"id":"doi:10.1145/2933057.2933084","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2933057.2933084","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/3529dd00-d3ae-484b-8905-9f790b40ce6d","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/3529dd00-d3ae-484b-8905-9f790b40ce6d","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Amiri , S , Schmid , S & Siebertz , S 2016 , A Local Constant Factor MDS Approximation for Bounded Genus Graphs . in Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing . Association for Computing Machinery , pp. 227-233 , ACM Symposium on Principles of Distributed Computing (PODC) , Chicago, Illinois , United States , 25/07/2016 . https://doi.org/10.1145/2933057.2933084","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W594463866","https://openalex.org/W1502920553","https://openalex.org/W1523755288","https://openalex.org/W1869515244","https://openalex.org/W1957963525","https://openalex.org/W1982471320","https://openalex.org/W2045385016","https://openalex.org/W2048769918","https://openalex.org/W2052474723","https://openalex.org/W2054910423","https://openalex.org/W2078400655","https://openalex.org/W2137594557","https://openalex.org/W2138623498","https://openalex.org/W2151757686","https://openalex.org/W2156760067","https://openalex.org/W2487418934","https://openalex.org/W4319589071"],"related_works":["https://openalex.org/W3184131894","https://openalex.org/W2513388465","https://openalex.org/W1490764355","https://openalex.org/W2329407138","https://openalex.org/W885288402","https://openalex.org/W4221065207","https://openalex.org/W3013085049","https://openalex.org/W4229684404","https://openalex.org/W3183249681","https://openalex.org/W2007607373"],"abstract_inverted_index":{"The":[0],"Minimum":[1],"Dominating":[2],"Set":[3],"(MDS)":[4],"problem":[5],"is":[6,19,29],"not":[7],"only":[8],"one":[9,21],"of":[10,22],"the":[11,23,43],"most":[12,24],"fundamental":[13],"problems":[14],"in":[15],"distributed":[16],"computing,":[17],"it":[18,28],"also":[20],"challenging":[25],"ones.":[26],"While":[27],"well-known":[30],"that":[31],"minimum":[32],"dominating":[33],"sets":[34],"cannot":[35],"be":[36],"approximated":[37],"locally":[38],"on":[39,51,55],"general":[40],"graphs,":[41],"over":[42],"last":[44],"years,":[45],"several":[46],"breakthroughs":[47],"have":[48],"been":[49],"made":[50],"computing":[52],"local":[53],"approximations":[54],"sparse":[56],"graphs.":[57]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}