Publication Information

{'id': 'https://openalex.org/W2352525723', 'doi': None, 'title': 'An Approximated Algorithm for the Minimum Degree Spanning Tree Problem', 'display_name': 'An Approximated Algorithm for the Minimum Degree Spanning Tree Problem', 'publication_year': 2013, 'publication_date': '2013-01-01', 'ids': {'openalex': 'https://openalex.org/W2352525723', 'mag': '2352525723'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://en.cnki.com.cn/Article_en/CJFDTotal-GKSX201301008.htm', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S2764605276', 'display_name': 'College Mathematics', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': True, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'journal-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/A5058088948', 'display_name': 'Shen Yu-hong', 'orcid': None}, 'institutions': [], 'countries': ['CN'], 'is_corresponding': True, 'raw_author_name': 'Shen Yu-hong', 'raw_affiliation_strings': ['Department of Mathematics,Dehong Teachers College,Mangshi,Yunnan 678400,China)'], 'affiliations': [{'raw_affiliation_string': 'Department of Mathematics,Dehong Teachers College,Mangshi,Yunnan 678400,China)', 'institution_ids': []}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 0, 'corresponding_author_ids': ['https://openalex.org/A5058088948'], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 0.0, 'has_fulltext': False, 'cited_by_count': 0, 'citation_normalized_percentile': {'value': 0.0, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 0, 'max': 65}, 'biblio': {'volume': None, 'issue': None, 'first_page': None, 'last_page': None}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T11814', 'display_name': 'Advanced Manufacturing and Logistics Optimization', 'score': 0.9891, 'subfield': {'id': 'https://openalex.org/subfields/2209', 'display_name': 'Industrial and Manufacturing Engineering'}, 'field': {'id': 'https://openalex.org/fields/22', 'display_name': 'Engineering'}, 'domain': {'id': 'https://openalex.org/domains/3', 'display_name': 'Physical Sciences'}}, 'topics': [{'id': 'https://openalex.org/T11814', 'display_name': 'Advanced Manufacturing and Logistics Optimization', 'score': 0.9891, 'subfield': {'id': 'https://openalex.org/subfields/2209', 'display_name': 'Industrial and Manufacturing Engineering'}, 'field': {'id': 'https://openalex.org/fields/22', 'display_name': 'Engineering'}, 'domain': {'id': 'https://openalex.org/domains/3', 'display_name': 'Physical Sciences'}}, {'id': 'https://openalex.org/T12176', 'display_name': 'Optimization and Packing Problems', 'score': 0.9706, 'subfield': {'id': 'https://openalex.org/subfields/2209', 'display_name': 'Industrial and Manufacturing Engineering'}, 'field': {'id': 'https://openalex.org/fields/22', 'display_name': 'Engineering'}, 'domain': {'id': 'https://openalex.org/domains/3', 'display_name': 'Physical Sciences'}}, {'id': 'https://openalex.org/T12288', 'display_name': 'Optimization and Search Problems', 'score': 0.9649, '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/degree', 'display_name': 'Degree (music)', 'score': 0.77899575}, {'id': 'https://openalex.org/keywords/k-minimum-spanning-tree', 'display_name': 'k-minimum spanning tree', 'score': 0.67724246}, {'id': 'https://openalex.org/keywords/reverse-delete-algorithm', 'display_name': 'Reverse-delete algorithm', 'score': 0.5287518}, {'id': 'https://openalex.org/keywords/tree', 'display_name': 'Tree (set theory)', 'score': 0.5279248}, {'id': 'https://openalex.org/keywords/prims-algorithm', 'display_name': "Prim's algorithm", 'score': 0.46752548}], 'concepts': [{'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.87446296}, {'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.8372588}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.8047596}, {'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.780992}, {'id': 'https://openalex.org/C2775997480', 'wikidata': 'https://www.wikidata.org/wiki/Q586277', 'display_name': 'Degree (music)', 'level': 2, 'score': 0.77899575}, {'id': 'https://openalex.org/C202750272', 'wikidata': 'https://www.wikidata.org/wiki/Q6322849', 'display_name': 'k-minimum spanning tree', 'level': 5, 'score': 0.67724246}, {'id': 'https://openalex.org/C63645285', 'wikidata': 'https://www.wikidata.org/wiki/Q797860', 'display_name': "Kruskal's algorithm", 'level': 3, 'score': 0.6686504}, {'id': 'https://openalex.org/C145685049', 'wikidata': 'https://www.wikidata.org/wiki/Q4454941', 'display_name': 'Euclidean minimum spanning tree', 'level': 4, 'score': 0.6114218}, {'id': 'https://openalex.org/C64271015', 'wikidata': 'https://www.wikidata.org/wiki/Q6865444', 'display_name': 'Minimum degree spanning tree', 'level': 3, 'score': 0.56394255}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.53429526}, {'id': 'https://openalex.org/C199346575', 'wikidata': 'https://www.wikidata.org/wiki/Q4925151', 'display_name': 'Reverse-delete algorithm', 'level': 4, 'score': 0.5287518}, {'id': 'https://openalex.org/C113174947', 'wikidata': 'https://www.wikidata.org/wiki/Q2859736', 'display_name': 'Tree (set theory)', 'level': 2, 'score': 0.5279248}, {'id': 'https://openalex.org/C1649724', 'wikidata': 'https://www.wikidata.org/wiki/Q470813', 'display_name': "Prim's algorithm", 'level': 4, 'score': 0.46752548}, {'id': 'https://openalex.org/C118615104', 'wikidata': 'https://www.wikidata.org/wiki/Q121416', 'display_name': 'Discrete mathematics', 'level': 1, 'score': 0.33622655}, {'id': 'https://openalex.org/C100560664', 'wikidata': 'https://www.wikidata.org/wiki/Q3608019', 'display_name': 'K-ary tree', 'level': 4, 'score': 0.22013804}, {'id': 'https://openalex.org/C163797641', 'wikidata': 'https://www.wikidata.org/wiki/Q2067937', 'display_name': 'Tree structure', 'level': 3, 'score': 0.18643141}, {'id': 'https://openalex.org/C197855036', 'wikidata': 'https://www.wikidata.org/wiki/Q380172', 'display_name': 'Binary tree', 'level': 2, 'score': 0.11680913}, {'id': 'https://openalex.org/C121332964', 'wikidata': 'https://www.wikidata.org/wiki/Q413', 'display_name': 'Physics', 'level': 0, 'score': 0.0}, {'id': 'https://openalex.org/C24890656', 'wikidata': 'https://www.wikidata.org/wiki/Q82811', 'display_name': 'Acoustics', 'level': 1, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://en.cnki.com.cn/Article_en/CJFDTotal-GKSX201301008.htm', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S2764605276', 'display_name': 'College Mathematics', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': True, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}], 'best_oa_location': None, 'sustainable_development_goals': [], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 0, 'referenced_works': [], 'related_works': ['https://openalex.org/W3187208706', 'https://openalex.org/W3010374802', 'https://openalex.org/W2899171524', 'https://openalex.org/W2803888831', 'https://openalex.org/W2518240130', 'https://openalex.org/W2396379829', 'https://openalex.org/W2361573941', 'https://openalex.org/W2355559160', 'https://openalex.org/W2354042733', 'https://openalex.org/W2350349857', 'https://openalex.org/W2349424300', 'https://openalex.org/W2122848400', 'https://openalex.org/W2095963760', 'https://openalex.org/W2074417667', 'https://openalex.org/W2014324934', 'https://openalex.org/W2010585027', 'https://openalex.org/W1965810411', 'https://openalex.org/W1965702747', 'https://openalex.org/W1576317141', 'https://openalex.org/W1561849181'], 'abstract_inverted_index': {'Minimum': [0, 14], 'Degree': [1, 15], 'Spanning': [2, 16, 22], 'Tree': [3, 17, 23], 'problem': [4], 'is': [5], 'NP-hard.This': [6], 'paper': [7], 'presents': [8], 'an': [9], 'approximation': [10], 'algorithm': [11], 'for': [12], 'the': [13, 31], 'problem.The': [18], 'algorithms': [19], 'give': [20], 'a': [21, 25], 'of': [24], 'degree': [26], 'at': [27], 'most': [28], 'one': [29], 'from': [30], 'optimal.': [32]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2352525723', 'counts_by_year': [], 'updated_date': '2024-12-09T01:57:19.278527', 'created_date': '2016-06-24'}