Publication Information

{'id': 'https://openalex.org/W2574250816', 'doi': 'https://doi.org/10.4230/lipics.approx-random.2016.11', 'title': 'Revisiting Connected Dominating Sets: An Optimal Local Algorithm?', 'display_name': 'Revisiting Connected Dominating Sets: An Optimal Local Algorithm?', 'publication_year': 2016, 'publication_date': '2016-01-01', 'ids': {'openalex': 'https://openalex.org/W2574250816', 'doi': 'https://doi.org/10.4230/lipics.approx-random.2016.11', 'mag': '2574250816'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.11', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306420261', 'display_name': 'International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], 'type': 'conference'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'proceedings-article', 'indexed_in': [], 'open_access': {'is_oa': False, 'oa_status': 'closed', 'oa_url': None, 'any_repository_has_fulltext': False}, 'authorships': [{'author_position': 'first', 'author': {'id': 'https://openalex.org/A5042716179', 'display_name': 'Samir Khuller', 'orcid': 'https://orcid.org/0000-0002-5408-8023'}, 'institutions': [{'id': 'https://openalex.org/I66946132', 'display_name': 'University of Maryland, College Park', 'ror': 'https://ror.org/047s2c258', 'country_code': 'US', 'type': 'education', 'lineage': ['https://openalex.org/I66946132']}], 'countries': ['US'], 'is_corresponding': False, 'raw_author_name': 'Samir Khuller', 'raw_affiliation_strings': ['University of Maryland, College Park, College Park, United States'], 'affiliations': [{'raw_affiliation_string': 'University of Maryland, College Park, College Park, United States', 'institution_ids': ['https://openalex.org/I66946132']}]}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5102000358', 'display_name': 'Sheng Yang', 'orcid': 'https://orcid.org/0000-0002-5884-4893'}, 'institutions': [{'id': 'https://openalex.org/I66946132', 'display_name': 'University of Maryland, College Park', 'ror': 'https://ror.org/047s2c258', 'country_code': 'US', 'type': 'education', 'lineage': ['https://openalex.org/I66946132']}], 'countries': ['US'], 'is_corresponding': False, 'raw_author_name': 'Sheng Yang', 'raw_affiliation_strings': ['University of Maryland, College Park, College Park, United States'], 'affiliations': [{'raw_affiliation_string': 'University of Maryland, College Park, College Park, United States', 'institution_ids': ['https://openalex.org/I66946132']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 1, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 0.243, 'has_fulltext': False, 'cited_by_count': 2, 'citation_normalized_percentile': {'value': 0.415065, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 73, 'max': 77}, 'biblio': {'volume': None, 'issue': None, 'first_page': '12', 'last_page': None}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10374', 'display_name': 'Advanced Graph Theory Research', 'score': 0.9854, '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/T10374', 'display_name': 'Advanced Graph Theory Research', 'score': 0.9854, '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/T10720', 'display_name': 'Complexity and Algorithms in Graphs', 'score': 0.9828, '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/T10991', 'display_name': 'Game Theory and Voting Systems', 'score': 0.982, 'subfield': {'id': 'https://openalex.org/subfields/2002', 'display_name': 'Economics and Econometrics'}, 'field': {'id': 'https://openalex.org/fields/20', 'display_name': 'Economics, Econometrics and Finance'}, 'domain': {'id': 'https://openalex.org/domains/2', 'display_name': 'Social Sciences'}}], 'keywords': [], 'concepts': [{'id': 'https://openalex.org/C51823790', 'wikidata': 'https://www.wikidata.org/wiki/Q504353', 'display_name': 'Greedy algorithm', 'level': 2, 'score': 0.7806171}, {'id': 'https://openalex.org/C42747912', 'wikidata': 'https://www.wikidata.org/wiki/Q1048447', 'display_name': 'Multiplicative function', 'level': 2, 'score': 0.73565185}, {'id': 'https://openalex.org/C148764684', 'wikidata': 'https://www.wikidata.org/wiki/Q621751', 'display_name': 'Approximation algorithm', 'level': 2, 'score': 0.71167946}, {'id': 'https://openalex.org/C37810922', 'wikidata': 'https://www.wikidata.org/wiki/Q5161409', 'display_name': 'Connected dominating set', 'level': 3, 'score': 0.5256556}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.50565267}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.4921786}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.4676131}, {'id': 'https://openalex.org/C126255220', 'wikidata': 'https://www.wikidata.org/wiki/Q141495', 'display_name': 'Mathematical optimization', 'level': 1, 'score': 0.45050222}, {'id': 'https://openalex.org/C177264268', 'wikidata': 'https://www.wikidata.org/wiki/Q1514741', 'display_name': 'Set (abstract data type)', 'level': 2, 'score': 0.42467785}, {'id': 'https://openalex.org/C126221529', 'wikidata': 'https://www.wikidata.org/wiki/Q3116070', 'display_name': 'Greedy randomized adaptive search procedure', 'level': 3, 'score': 0.42096964}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.38777003}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.25876713}, {'id': 'https://openalex.org/C134306372', 'wikidata': 'https://www.wikidata.org/wiki/Q7754', 'display_name': 'Mathematical analysis', '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': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.11', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306420261', 'display_name': 'International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], 'type': 'conference'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}], 'best_oa_location': None, 'sustainable_development_goals': [{'score': 0.57, 'id': 'https://metadata.un.org/sdg/16', 'display_name': 'Peace, justice, and strong institutions'}], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 0, 'referenced_works': [], 'related_works': ['https://openalex.org/W821239940', 'https://openalex.org/W3131432665', 'https://openalex.org/W3081060058', 'https://openalex.org/W3047117384', 'https://openalex.org/W2963996640', 'https://openalex.org/W2963222815', 'https://openalex.org/W2769089452', 'https://openalex.org/W2766359923', 'https://openalex.org/W2284958355', 'https://openalex.org/W2256057849', 'https://openalex.org/W2164438232', 'https://openalex.org/W2154411092', 'https://openalex.org/W2120899253', 'https://openalex.org/W2031827905', 'https://openalex.org/W1884349932', 'https://openalex.org/W1733484739', 'https://openalex.org/W1675952514', 'https://openalex.org/W1577719727', 'https://openalex.org/W1575611224', 'https://openalex.org/W1517950463'], 'abstract_inverted_index': {'In': [0, 118], 'this': [1, 22, 119], 'paper': [2], 'we': [3, 89, 121], 'consider': [4], 'the': [5, 50, 56, 60, 71, 96, 101, 106, 109, 115, 126], 'classical': [6], 'Connected': [7], 'Dominating': [8], 'Set': [9], '(CDS)': [10], 'problem.': [11], 'Twenty': [12], 'years': [13], 'ago,': [14], 'Guha': [15], 'and': [16, 36, 53, 73], 'Khuller': [17], 'developed': [18], 'two': [19], 'algorithms': [20], 'for': [21], 'problem': [23], '-': [24, 87], 'a': [25, 37, 78, 83, 91], 'centralized': [26], 'greedy': [27, 39, 64, 93, 103], 'approach': [28, 40], 'with': [29, 41, 95], 'an': [30, 42], 'approximation': [31, 43, 116], 'guarantee': [32, 44, 99], 'of': [33, 45, 80, 108, 112], 'H(D)': [34], '+2,': [35], 'local': [38, 63, 92], '2(H(D)+1)': [46], '(where': [47], 'H()': [48], 'is': [49, 55], 'harmonic': [51], 'function,': [52], 'D': [54], 'maximum': [57], 'degree': [58], 'in': [59, 77, 114, 125], 'graph).': [61], 'A': [62], 'algorithm': [65, 94, 104], 'uses': [66], 'significantly': [67], 'less': [68], 'information': [69], 'about': [70], 'graph,': [72], 'can': [74, 88], 'be': [75], 'useful': [76], 'variety': [79], 'contexts.': [81], 'However,': [82], 'fundamental': [84], 'question': [85, 124], 'remained': [86], 'get': [90], 'same': [97], 'performance': [98], 'as': [100], 'global': [102], 'without': [105], 'penalty': [107], 'multiplicative': [110], 'factor': [111], '2': [113], 'factor?': [117], 'paper,': [120], 'answer': [122], 'that': [123], 'affirmative.': [127]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2574250816', 'counts_by_year': [{'year': 2020, 'cited_by_count': 1}, {'year': 2019, 'cited_by_count': 1}], 'updated_date': '2024-12-15T04:43:04.286412', 'created_date': '2017-01-26'}