Get quick answers to your questions about the article from our AI researcher chatbot
{'id': 'https://openalex.org/W3184075718', 'doi': 'https://doi.org/10.1007/978-3-030-80879-2_13', 'title': 'An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem', 'display_name': 'An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem', 'publication_year': 2021, 'publication_date': '2021-01-01', 'ids': {'openalex': 'https://openalex.org/W3184075718', 'doi': 'https://doi.org/10.1007/978-3-030-80879-2_13', 'mag': '3184075718'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.1007/978-3-030-80879-2_13', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S106296714', 'display_name': 'Lecture notes in computer science', 'issn_l': '0302-9743', 'issn': ['0302-9743', '1611-3349'], 'is_oa': False, 'is_in_doaj': False, 'is_core': True, 'host_organization': 'https://openalex.org/P4310319900', 'host_organization_name': 'Springer Science+Business Media', 'host_organization_lineage': ['https://openalex.org/P4310319965', 'https://openalex.org/P4310319900'], 'host_organization_lineage_names': ['Springer Nature', 'Springer Science+Business Media'], 'type': 'book series'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'book-chapter', 'type_crossref': 'book-chapter', 'indexed_in': ['crossref'], '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/A5014376761', 'display_name': 'Ardalan Khazraei', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I176453806', 'display_name': 'University of Potsdam', 'ror': 'https://ror.org/03bnmw459', 'country_code': 'DE', 'type': 'education', 'lineage': ['https://openalex.org/I176453806']}], 'countries': ['DE'], 'is_corresponding': True, 'raw_author_name': 'Ardalan Khazraei', 'raw_affiliation_strings': ['Linguistics Department, University of Potsdam, Potsdam, Germany'], 'affiliations': [{'raw_affiliation_string': 'Linguistics Department, University of Potsdam, Potsdam, Germany', 'institution_ids': ['https://openalex.org/I176453806']}]}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5089221320', 'display_name': 'Stephan Held', 'orcid': 'https://orcid.org/0000-0003-2188-1559'}, 'institutions': [{'id': 'https://openalex.org/I135140700', 'display_name': 'University of Bonn', 'ror': 'https://ror.org/041nas322', 'country_code': 'DE', 'type': 'education', 'lineage': ['https://openalex.org/I135140700']}], 'countries': ['DE'], 'is_corresponding': True, 'raw_author_name': 'Stephan Held', 'raw_affiliation_strings': ['Research Institute for Discrete Mathematics, University of Bonn, Bonn, Germany'], 'affiliations': [{'raw_affiliation_string': 'Research Institute for Discrete Mathematics, University of Bonn, Bonn, Germany', 'institution_ids': ['https://openalex.org/I135140700']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 2, 'corresponding_author_ids': ['https://openalex.org/A5014376761', 'https://openalex.org/A5089221320'], 'corresponding_institution_ids': ['https://openalex.org/I176453806', 'https://openalex.org/I135140700'], 'apc_list': {'value': 5000, 'currency': 'EUR', 'value_usd': 5392, 'provenance': 'doaj'}, 'apc_paid': None, 'fwci': 0.531, 'has_fulltext': False, 'cited_by_count': 1, 'citation_normalized_percentile': {'value': 0.596082, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 57, 'max': 67}, 'biblio': {'volume': None, 'issue': None, 'first_page': '189', 'last_page': '203'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10720', 'display_name': 'Complexity and Algorithms in Graphs', 'score': 0.9997, '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.9997, '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/T10996', 'display_name': 'Computational Geometry and Mesh Generation', 'score': 0.9991, 'subfield': {'id': 'https://openalex.org/subfields/1704', 'display_name': 'Computer Graphics and Computer-Aided Design'}, '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.9984, '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'}}], 'keywords': [{'id': 'https://openalex.org/keywords/steiner-tree-problem', 'display_name': 'Steiner tree problem', 'score': 0.9549542}, {'id': 'https://openalex.org/keywords/k-minimum-spanning-tree', 'display_name': 'k-minimum spanning tree', 'score': 0.564931}, {'id': 'https://openalex.org/keywords/tree', 'display_name': 'Tree (set theory)', 'score': 0.5093533}, {'id': 'https://openalex.org/keywords/linear-programming-relaxation', 'display_name': 'Linear programming relaxation', 'score': 0.5040197}, {'id': 'https://openalex.org/keywords/gomory–hu-tree', 'display_name': 'Gomory–Hu tree', 'score': 0.41996944}], 'concepts': [{'id': 'https://openalex.org/C76220878', 'wikidata': 'https://www.wikidata.org/wiki/Q1764144', 'display_name': 'Steiner tree problem', 'level': 2, 'score': 0.9549542}, {'id': 'https://openalex.org/C148764684', 'wikidata': 'https://www.wikidata.org/wiki/Q621751', 'display_name': 'Approximation algorithm', 'level': 2, 'score': 0.78829557}, {'id': 'https://openalex.org/C202750272', 'wikidata': 'https://www.wikidata.org/wiki/Q6322849', 'display_name': 'k-minimum spanning tree', 'level': 5, 'score': 0.564931}, {'id': 'https://openalex.org/C2777735758', 'wikidata': 'https://www.wikidata.org/wiki/Q817765', 'display_name': 'Path (computing)', 'level': 2, 'score': 0.5544815}, {'id': 'https://openalex.org/C34388435', 'wikidata': 'https://www.wikidata.org/wiki/Q2267362', 'display_name': 'Bounded function', 'level': 2, 'score': 0.53332007}, {'id': 'https://openalex.org/C113174947', 'wikidata': 'https://www.wikidata.org/wiki/Q2859736', 'display_name': 'Tree (set theory)', 'level': 2, 'score': 0.5093533}, {'id': 'https://openalex.org/C25360446', 'wikidata': 'https://www.wikidata.org/wiki/Q1512771', 'display_name': 'Linear programming relaxation', 'level': 3, 'score': 0.5040197}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.47070882}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.44775695}, {'id': 'https://openalex.org/C162307627', 'wikidata': 'https://www.wikidata.org/wiki/Q204833', 'display_name': 'Enhanced Data Rates for GSM Evolution', 'level': 2, 'score': 0.4441732}, {'id': 'https://openalex.org/C108005400', 'wikidata': 'https://www.wikidata.org/wiki/Q1305598', 'display_name': 'Facility location problem', 'level': 2, 'score': 0.43542367}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.43399483}, {'id': 'https://openalex.org/C147517495', 'wikidata': 'https://www.wikidata.org/wiki/Q5581241', 'display_name': 'Gomory–Hu tree', 'level': 5, 'score': 0.41996944}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.4166453}, {'id': 'https://openalex.org/C126255220', 'wikidata': 'https://www.wikidata.org/wiki/Q141495', 'display_name': 'Mathematical optimization', 'level': 1, 'score': 0.3732001}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.37210137}, {'id': 'https://openalex.org/C100560664', 'wikidata': 'https://www.wikidata.org/wiki/Q3608019', 'display_name': 'K-ary tree', 'level': 4, 'score': 0.30061707}, {'id': 'https://openalex.org/C163797641', 'wikidata': 'https://www.wikidata.org/wiki/Q2067937', 'display_name': 'Tree structure', 'level': 3, 'score': 0.26318127}, {'id': 'https://openalex.org/C41045048', 'wikidata': 'https://www.wikidata.org/wiki/Q202843', 'display_name': 'Linear programming', 'level': 2, 'score': 0.16353479}, {'id': 'https://openalex.org/C197855036', 'wikidata': 'https://www.wikidata.org/wiki/Q380172', 'display_name': 'Binary tree', 'level': 2, 'score': 0.15255785}, {'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/C76155785', 'wikidata': 'https://www.wikidata.org/wiki/Q418', 'display_name': 'Telecommunications', '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.1007/978-3-030-80879-2_13', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S106296714', 'display_name': 'Lecture notes in computer science', 'issn_l': '0302-9743', 'issn': ['0302-9743', '1611-3349'], 'is_oa': False, 'is_in_doaj': False, 'is_core': True, 'host_organization': 'https://openalex.org/P4310319900', 'host_organization_name': 'Springer Science+Business Media', 'host_organization_lineage': ['https://openalex.org/P4310319965', 'https://openalex.org/P4310319900'], 'host_organization_lineage_names': ['Springer Nature', 'Springer Science+Business Media'], 'type': 'book series'}, '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': 19, 'referenced_works': ['https://openalex.org/W1511618541', 'https://openalex.org/W1759768216', 'https://openalex.org/W1971211506', 'https://openalex.org/W1976584101', 'https://openalex.org/W1989669912', 'https://openalex.org/W1990317614', 'https://openalex.org/W2022174455', 'https://openalex.org/W2084224084', 'https://openalex.org/W2106676868', 'https://openalex.org/W2108573551', 'https://openalex.org/W2144677702', 'https://openalex.org/W2151822553', 'https://openalex.org/W2166747457', 'https://openalex.org/W2232049732', 'https://openalex.org/W2609612113', 'https://openalex.org/W2790830285', 'https://openalex.org/W2914161519', 'https://openalex.org/W2951475756', 'https://openalex.org/W4285719527'], 'related_works': ['https://openalex.org/W974563791', 'https://openalex.org/W4244816249', 'https://openalex.org/W2999680961', 'https://openalex.org/W2949165555', 'https://openalex.org/W2739242419', 'https://openalex.org/W2183636263', 'https://openalex.org/W2096702260', 'https://openalex.org/W1595291551', 'https://openalex.org/W1585318792', 'https://openalex.org/W1524393328'], 'abstract_inverted_index': None, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W3184075718', 'counts_by_year': [{'year': 2021, 'cited_by_count': 1}], 'updated_date': '2024-12-16T22:06:16.308766', 'created_date': '2021-08-02'}