Get quick answers to your questions about the article from our AI researcher chatbot
{'id': 'https://openalex.org/W2918064078', 'doi': None, 'title': '2-I-6 Dijkstra-based algorithms for a shortest path problem with edges of negative length (part 1)', 'display_name': '2-I-6 Dijkstra-based algorithms for a shortest path problem with edges of negative length (part 1)', 'publication_year': 2011, 'publication_date': '2011-09-13', 'ids': {'openalex': 'https://openalex.org/W2918064078', 'mag': '2918064078'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'http://ci.nii.ac.jp/naid/110009358953', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306550689', 'display_name': '日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集', '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': '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/A5055953889', 'display_name': '明 中山', 'orcid': None}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': '明 中山', 'raw_affiliation_strings': [], 'affiliations': []}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5075665853', 'display_name': '務 穴澤', 'orcid': None}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': '務 穴澤', 'raw_affiliation_strings': [], 'affiliations': []}], 'institution_assertions': [], 'countries_distinct_count': 0, 'institutions_distinct_count': 0, 'corresponding_author_ids': [], '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': 66}, 'biblio': {'volume': '2011', 'issue': None, 'first_page': '336', 'last_page': '337'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T11106', 'display_name': 'Trajectory Data Mining and Analysis', 'score': 0.962, '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.962, '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/T12176', 'display_name': 'Optimization of Cutting and Packing Problems', 'score': 0.9558, '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/T10996', 'display_name': 'Mesh Generation Algorithms', 'score': 0.9432, '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/yens-algorithm', 'display_name': "Yen's algorithm", 'score': 0.7458609}, {'id': 'https://openalex.org/keywords/approximation-algorithms', 'display_name': 'Approximation Algorithms', 'score': 0.557075}, {'id': 'https://openalex.org/keywords/geometric-optimization', 'display_name': 'Geometric Optimization', 'score': 0.554828}, {'id': 'https://openalex.org/keywords/computational-geometry', 'display_name': 'Computational Geometry', 'score': 0.552071}, {'id': 'https://openalex.org/keywords/heuristic-algorithms', 'display_name': 'Heuristic Algorithms', 'score': 0.547921}, {'id': 'https://openalex.org/keywords/metaheuristic-algorithms', 'display_name': 'Metaheuristic Algorithms', 'score': 0.537708}, {'id': 'https://openalex.org/keywords/euclidean-shortest-path', 'display_name': 'Euclidean shortest path', 'score': 0.50231695}], 'concepts': [{'id': 'https://openalex.org/C119971455', 'wikidata': 'https://www.wikidata.org/wiki/Q8052172', 'display_name': "Yen's algorithm", 'level': 5, 'score': 0.7458609}, {'id': 'https://openalex.org/C70266271', 'wikidata': 'https://www.wikidata.org/wiki/Q6343044', 'display_name': 'K shortest path routing', 'level': 4, 'score': 0.7215175}, {'id': 'https://openalex.org/C173870130', 'wikidata': 'https://www.wikidata.org/wiki/Q8548', 'display_name': "Dijkstra's algorithm", 'level': 4, 'score': 0.6876744}, {'id': 'https://openalex.org/C22590252', 'wikidata': 'https://www.wikidata.org/wiki/Q1058754', 'display_name': 'Shortest path problem', 'level': 3, 'score': 0.68435365}, {'id': 'https://openalex.org/C168451585', 'wikidata': 'https://www.wikidata.org/wiki/Q7502159', 'display_name': 'Shortest Path Faster Algorithm', 'level': 5, 'score': 0.6607564}, {'id': 'https://openalex.org/C2777735758', 'wikidata': 'https://www.wikidata.org/wiki/Q817765', 'display_name': 'Path (computing)', 'level': 2, 'score': 0.54431367}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.5162782}, {'id': 'https://openalex.org/C170836113', 'wikidata': 'https://www.wikidata.org/wiki/Q5406126', 'display_name': 'Euclidean shortest path', 'level': 5, 'score': 0.50231695}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.47730696}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.44265792}, {'id': 'https://openalex.org/C25321074', 'wikidata': 'https://www.wikidata.org/wiki/Q1969601', 'display_name': 'Pathfinding', 'level': 4, 'score': 0.42516863}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.42143765}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.13214019}, {'id': 'https://openalex.org/C31258907', 'wikidata': 'https://www.wikidata.org/wiki/Q1301371', 'display_name': 'Computer network', 'level': 1, 'score': 0.06353629}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'http://ci.nii.ac.jp/naid/110009358953', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306550689', 'display_name': '日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集', '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': '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/W356531705', 'https://openalex.org/W3204579877', 'https://openalex.org/W3138148611', 'https://openalex.org/W3129923565', 'https://openalex.org/W2808332191', 'https://openalex.org/W2570013196', 'https://openalex.org/W2466934300', 'https://openalex.org/W2398424124', 'https://openalex.org/W2387644816', 'https://openalex.org/W2366342492', 'https://openalex.org/W2349983918', 'https://openalex.org/W2349091433', 'https://openalex.org/W2183462251', 'https://openalex.org/W2163460271', 'https://openalex.org/W2092330486', 'https://openalex.org/W2058956837', 'https://openalex.org/W2031116793', 'https://openalex.org/W2020556531', 'https://openalex.org/W2006429817', 'https://openalex.org/W197854957'], 'abstract_inverted_index': None, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2918064078', 'counts_by_year': [], 'updated_date': '2024-09-14T03:47:04.877767', 'created_date': '2019-03-02'}