Get quick answers to your questions about the article from our AI researcher chatbot
{'id': 'https://openalex.org/W2100214387', 'doi': 'https://doi.org/10.1007/978-3-540-72870-2_33', 'title': 'BMA *: An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road Maps', 'display_name': 'BMA *: An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road Maps', 'publication_year': 2007, 'publication_date': '2007-06-25', 'ids': {'openalex': 'https://openalex.org/W2100214387', 'doi': 'https://doi.org/10.1007/978-3-540-72870-2_33', 'mag': '2100214387'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.1007/978-3-540-72870-2_33', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306463937', 'display_name': 'Springer eBooks', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': 'https://openalex.org/P4310319965', 'host_organization_name': 'Springer Nature', 'host_organization_lineage': ['https://openalex.org/P4310319965'], 'host_organization_lineage_names': ['Springer Nature'], 'type': 'ebook platform'}, '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/A5023085024', 'display_name': 'Dan He', 'orcid': 'https://orcid.org/0000-0001-9064-566X'}, 'institutions': [{'id': 'https://openalex.org/I111236770', 'display_name': 'University of Vermont', 'ror': 'https://ror.org/0155zta11', 'country_code': 'US', 'type': 'education', 'lineage': ['https://openalex.org/I111236770']}], 'countries': ['US'], 'is_corresponding': True, 'raw_author_name': 'Dan He', 'raw_affiliation_strings': ['Department of Computer Science, University of Vermont, Burlington, VT 05405 USA.'], 'affiliations': [{'raw_affiliation_string': 'Department of Computer Science, University of Vermont, Burlington, VT 05405 USA.', 'institution_ids': ['https://openalex.org/I111236770']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 1, 'corresponding_author_ids': ['https://openalex.org/A5023085024'], 'corresponding_institution_ids': ['https://openalex.org/I111236770'], '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': 63}, 'biblio': {'volume': None, 'issue': None, 'first_page': '346', 'last_page': '357'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T11106', 'display_name': 'Trajectory Data Mining and Analysis', 'score': 0.9999, 'subfield': {'id': 'https://openalex.org/subfields/1711', 'display_name': 'Signal Processing'}, '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/T11106', 'display_name': 'Trajectory Data Mining and Analysis', 'score': 0.9999, 'subfield': {'id': 'https://openalex.org/subfields/1711', 'display_name': 'Signal Processing'}, '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/T10317', 'display_name': 'Data Stream Management Systems and Techniques', 'score': 0.9977, '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/T12016', 'display_name': 'Web Data Extraction and Crawling Techniques', 'score': 0.9807, 'subfield': {'id': 'https://openalex.org/subfields/1710', 'display_name': 'Information Systems'}, '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/yens-algorithm', 'display_name': "Yen's algorithm", 'score': 0.8579326}, {'id': 'https://openalex.org/keywords/suurballes-algorithm', 'display_name': "Suurballe's algorithm", 'score': 0.7804035}, {'id': 'https://openalex.org/keywords/floyd–warshall-algorithm', 'display_name': 'Floyd–Warshall algorithm', 'score': 0.6573269}, {'id': 'https://openalex.org/keywords/a*-search-algorithm', 'display_name': 'A* search algorithm', 'score': 0.5080521}, {'id': 'https://openalex.org/keywords/query-optimization', 'display_name': 'Query Optimization', 'score': 0.498463}, {'id': 'https://openalex.org/keywords/euclidean-shortest-path', 'display_name': 'Euclidean shortest path', 'score': 0.49254593}, {'id': 'https://openalex.org/keywords/widest-path-problem', 'display_name': 'Widest path problem', 'score': 0.4825141}, {'id': 'https://openalex.org/keywords/distance', 'display_name': 'Distance', 'score': 0.47187796}], 'concepts': [{'id': 'https://openalex.org/C119971455', 'wikidata': 'https://www.wikidata.org/wiki/Q8052172', 'display_name': "Yen's algorithm", 'level': 5, 'score': 0.8579326}, {'id': 'https://openalex.org/C22590252', 'wikidata': 'https://www.wikidata.org/wiki/Q1058754', 'display_name': 'Shortest path problem', 'level': 3, 'score': 0.82426643}, {'id': 'https://openalex.org/C168451585', 'wikidata': 'https://www.wikidata.org/wiki/Q7502159', 'display_name': 'Shortest Path Faster Algorithm', 'level': 5, 'score': 0.8215544}, {'id': 'https://openalex.org/C70266271', 'wikidata': 'https://www.wikidata.org/wiki/Q6343044', 'display_name': 'K shortest path routing', 'level': 4, 'score': 0.81765527}, {'id': 'https://openalex.org/C173870130', 'wikidata': 'https://www.wikidata.org/wiki/Q8548', 'display_name': "Dijkstra's algorithm", 'level': 4, 'score': 0.79963064}, {'id': 'https://openalex.org/C98779529', 'wikidata': 'https://www.wikidata.org/wiki/Q7650417', 'display_name': "Suurballe's algorithm", 'level': 5, 'score': 0.7804035}, {'id': 'https://openalex.org/C186065694', 'wikidata': 'https://www.wikidata.org/wiki/Q1047576', 'display_name': 'Floyd–Warshall algorithm', 'level': 5, 'score': 0.6573269}, {'id': 'https://openalex.org/C25321074', 'wikidata': 'https://www.wikidata.org/wiki/Q1969601', 'display_name': 'Pathfinding', 'level': 4, 'score': 0.5801809}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.54759073}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.5422531}, {'id': 'https://openalex.org/C103578098', 'wikidata': 'https://www.wikidata.org/wiki/Q277680', 'display_name': 'A* search algorithm', 'level': 2, 'score': 0.5080521}, {'id': 'https://openalex.org/C170836113', 'wikidata': 'https://www.wikidata.org/wiki/Q5406126', 'display_name': 'Euclidean shortest path', 'level': 5, 'score': 0.49254593}, {'id': 'https://openalex.org/C83677490', 'wikidata': 'https://www.wikidata.org/wiki/Q7998708', 'display_name': 'Widest path problem', 'level': 5, 'score': 0.4825141}, {'id': 'https://openalex.org/C54385418', 'wikidata': 'https://www.wikidata.org/wiki/Q2742711', 'display_name': 'Distance', 'level': 4, 'score': 0.47187796}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.42308718}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.38515288}, {'id': 'https://openalex.org/C80444323', 'wikidata': 'https://www.wikidata.org/wiki/Q2878974', 'display_name': 'Theoretical computer science', 'level': 1, 'score': 0.27831793}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://doi.org/10.1007/978-3-540-72870-2_33', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306463937', 'display_name': 'Springer eBooks', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': 'https://openalex.org/P4310319965', 'host_organization_name': 'Springer Nature', 'host_organization_lineage': ['https://openalex.org/P4310319965'], 'host_organization_lineage_names': ['Springer Nature'], 'type': 'ebook platform'}, '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': 17, 'referenced_works': ['https://openalex.org/W1493214567', 'https://openalex.org/W1599325086', 'https://openalex.org/W1969483458', 'https://openalex.org/W2010802092', 'https://openalex.org/W2014889099', 'https://openalex.org/W2026824953', 'https://openalex.org/W2083355299', 'https://openalex.org/W2085917651', 'https://openalex.org/W2100586428', 'https://openalex.org/W2129776415', 'https://openalex.org/W2151400766', 'https://openalex.org/W2151601049', 'https://openalex.org/W2164485560', 'https://openalex.org/W2169528473', 'https://openalex.org/W2501059503', 'https://openalex.org/W2504529850', 'https://openalex.org/W30435042'], 'related_works': ['https://openalex.org/W651485002', 'https://openalex.org/W4388551080', 'https://openalex.org/W3029625820', 'https://openalex.org/W2537573442', 'https://openalex.org/W2387644816', 'https://openalex.org/W2313272286', 'https://openalex.org/W2183791707', 'https://openalex.org/W2163460271', 'https://openalex.org/W2121354321', 'https://openalex.org/W2100214387'], 'abstract_inverted_index': None, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2100214387', 'counts_by_year': [], 'updated_date': '2024-09-25T05:17:15.525201', 'created_date': '2016-06-24'}