Get quick answers to your questions about the article from our AI researcher chatbot
{'id': 'https://openalex.org/W1998126097', 'doi': 'https://doi.org/10.1006/jagm.2000.1086', 'title': 'A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3', 'display_name': 'A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3', 'publication_year': 2000, 'publication_date': '2000-07-01', 'ids': {'openalex': 'https://openalex.org/W1998126097', 'doi': 'https://doi.org/10.1006/jagm.2000.1086', 'mag': '1998126097'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.1006/jagm.2000.1086', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S110520077', 'display_name': 'Journal of Algorithms', 'issn_l': '0196-6774', 'issn': ['0196-6774', '1090-2678'], 'is_oa': False, 'is_in_doaj': False, 'is_core': True, 'host_organization': 'https://openalex.org/P4310319955', 'host_organization_name': 'Academic Press', 'host_organization_lineage': ['https://openalex.org/P4310320990', 'https://openalex.org/P4310319955'], 'host_organization_lineage_names': ['Elsevier BV', 'Academic Press'], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'journal-article', '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/A5072637221', 'display_name': 'Hans Jürgen Prömel', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I39343248', 'display_name': 'Humboldt-Universität zu Berlin', 'ror': 'https://ror.org/01hcx6992', 'country_code': 'DE', 'type': 'education', 'lineage': ['https://openalex.org/I39343248']}], 'countries': ['DE'], 'is_corresponding': False, 'raw_author_name': 'Hans Jürgen Prömel', 'raw_affiliation_strings': ['Institut für Informatik, Humboldt Universität zu Berlin, 10099, Berlin, [email protected]#TAB#'], 'affiliations': [{'raw_affiliation_string': 'Institut für Informatik, Humboldt Universität zu Berlin, 10099, Berlin, [email protected]#TAB#', 'institution_ids': ['https://openalex.org/I39343248']}]}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5062687538', 'display_name': 'Angelika Steger', 'orcid': 'https://orcid.org/0000-0002-3465-3996'}, 'institutions': [{'id': 'https://openalex.org/I62916508', 'display_name': 'Technical University of Munich', 'ror': 'https://ror.org/02kkvpp62', 'country_code': 'DE', 'type': 'education', 'lineage': ['https://openalex.org/I62916508']}], 'countries': ['DE'], 'is_corresponding': False, 'raw_author_name': 'Angelika Steger', 'raw_affiliation_strings': ['Institut für Informatik, Technische Universität München, 80290, München, [email protected]'], 'affiliations': [{'raw_affiliation_string': 'Institut für Informatik, Technische Universität München, 80290, München, [email protected]', 'institution_ids': ['https://openalex.org/I62916508']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 2, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 3.691, 'has_fulltext': True, 'fulltext_origin': 'ngrams', 'cited_by_count': 106, 'citation_normalized_percentile': {'value': 0.985164, 'is_in_top_1_percent': False, 'is_in_top_10_percent': True}, 'cited_by_percentile_year': {'min': 96, 'max': 97}, 'biblio': {'volume': '36', 'issue': '1', 'first_page': '89', 'last_page': '101'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10720', 'display_name': 'Complexity and Algorithms in Graphs', 'score': 0.9996, '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.9996, '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/T11522', 'display_name': 'VLSI and FPGA Design Techniques', 'score': 0.9976, 'subfield': {'id': 'https://openalex.org/subfields/2208', 'display_name': 'Electrical and Electronic 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/T10996', 'display_name': 'Computational Geometry and Mesh Generation', 'score': 0.9955, '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'}}], 'keywords': [{'id': 'https://openalex.org/keywords/steiner-tree-problem', 'display_name': 'Steiner tree problem', 'score': 0.94947964}, {'id': 'https://openalex.org/keywords/k-minimum-spanning-tree', 'display_name': 'k-minimum spanning tree', 'score': 0.67104334}, {'id': 'https://openalex.org/keywords/polynomial-time-approximation-scheme', 'display_name': 'Polynomial-time approximation scheme', 'score': 0.5642607}, {'id': 'https://openalex.org/keywords/tree', 'display_name': 'Tree (set theory)', 'score': 0.5074362}], 'concepts': [{'id': 'https://openalex.org/C76220878', 'wikidata': 'https://www.wikidata.org/wiki/Q1764144', 'display_name': 'Steiner tree problem', 'level': 2, 'score': 0.94947964}, {'id': 'https://openalex.org/C148764684', 'wikidata': 'https://www.wikidata.org/wiki/Q621751', 'display_name': 'Approximation algorithm', 'level': 2, 'score': 0.8071444}, {'id': 'https://openalex.org/C202750272', 'wikidata': 'https://www.wikidata.org/wiki/Q6322849', 'display_name': 'k-minimum spanning tree', 'level': 5, 'score': 0.67104334}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.6362215}, {'id': 'https://openalex.org/C99140742', 'wikidata': 'https://www.wikidata.org/wiki/Q843550', 'display_name': 'Polynomial-time approximation scheme', 'level': 3, 'score': 0.5642607}, {'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.5143541}, {'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.5123321}, {'id': 'https://openalex.org/C113174947', 'wikidata': 'https://www.wikidata.org/wiki/Q2859736', 'display_name': 'Tree (set theory)', 'level': 2, 'score': 0.5074362}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.4870084}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.3720107}, {'id': 'https://openalex.org/C118615104', 'wikidata': 'https://www.wikidata.org/wiki/Q121416', 'display_name': 'Discrete mathematics', 'level': 1, 'score': 0.3695619}, {'id': 'https://openalex.org/C100560664', 'wikidata': 'https://www.wikidata.org/wiki/Q3608019', 'display_name': 'K-ary tree', 'level': 4, 'score': 0.33845478}, {'id': 'https://openalex.org/C126255220', 'wikidata': 'https://www.wikidata.org/wiki/Q141495', 'display_name': 'Mathematical optimization', 'level': 1, 'score': 0.32926768}, {'id': 'https://openalex.org/C163797641', 'wikidata': 'https://www.wikidata.org/wiki/Q2067937', 'display_name': 'Tree structure', 'level': 3, 'score': 0.20116588}, {'id': 'https://openalex.org/C197855036', 'wikidata': 'https://www.wikidata.org/wiki/Q380172', 'display_name': 'Binary tree', 'level': 2, 'score': 0.090997964}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://doi.org/10.1006/jagm.2000.1086', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S110520077', 'display_name': 'Journal of Algorithms', 'issn_l': '0196-6774', 'issn': ['0196-6774', '1090-2678'], 'is_oa': False, 'is_in_doaj': False, 'is_core': True, 'host_organization': 'https://openalex.org/P4310319955', 'host_organization_name': 'Academic Press', 'host_organization_lineage': ['https://openalex.org/P4310320990', 'https://openalex.org/P4310319955'], 'host_organization_lineage_names': ['Elsevier BV', 'Academic Press'], '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': 24, 'referenced_works': ['https://openalex.org/W109985799', 'https://openalex.org/W1531591475', 'https://openalex.org/W1535706250', 'https://openalex.org/W15553240', 'https://openalex.org/W1975290397', 'https://openalex.org/W1981234161', 'https://openalex.org/W1988698339', 'https://openalex.org/W1996668544', 'https://openalex.org/W1997126046', 'https://openalex.org/W2003882909', 'https://openalex.org/W2012130001', 'https://openalex.org/W2031297526', 'https://openalex.org/W2066356146', 'https://openalex.org/W2070664846', 'https://openalex.org/W2080063509', 'https://openalex.org/W2087311268', 'https://openalex.org/W2143391442', 'https://openalex.org/W2157338118', 'https://openalex.org/W2401610261', 'https://openalex.org/W2414169618', 'https://openalex.org/W2586554544', 'https://openalex.org/W2610479830', 'https://openalex.org/W3127447045', 'https://openalex.org/W593649846'], 'related_works': ['https://openalex.org/W4225489905', 'https://openalex.org/W3111415871', 'https://openalex.org/W3093504479', 'https://openalex.org/W278944754', 'https://openalex.org/W2788398742', 'https://openalex.org/W2039405536', 'https://openalex.org/W2035040468', 'https://openalex.org/W1998126097', 'https://openalex.org/W1983607113', 'https://openalex.org/W1978034843'], 'abstract_inverted_index': None, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W1998126097', 'counts_by_year': [{'year': 2024, 'cited_by_count': 1}, {'year': 2023, 'cited_by_count': 5}, {'year': 2022, 'cited_by_count': 2}, {'year': 2021, 'cited_by_count': 8}, {'year': 2020, 'cited_by_count': 3}, {'year': 2019, 'cited_by_count': 4}, {'year': 2018, 'cited_by_count': 3}, {'year': 2017, 'cited_by_count': 6}, {'year': 2016, 'cited_by_count': 4}, {'year': 2015, 'cited_by_count': 3}, {'year': 2014, 'cited_by_count': 4}, {'year': 2013, 'cited_by_count': 9}, {'year': 2012, 'cited_by_count': 8}], 'updated_date': '2024-12-15T23:04:06.398353', 'created_date': '2016-06-24'}