{"id":"https://openalex.org/W396897486","doi":null,"title":"A Landmark Algorithm for the Time-Dependent Shortest Path Problem","display_name":"A Landmark Algorithm for the Time-Dependent Shortest Path Problem","alternate_titles":[],"publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W396897486","mag":"396897486"},"language":"en","primary_location":{"id":"mag:2183791707","doi":null,"is_oa":false,"landing_page_url":"https://www-or.amp.i.kyoto-u.ac.jp/members/ohshima/Paper/MThesis/MThesis.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W396897486"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006637021","display_name":"\u9054\u4e5f \u5927\u5d8b","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Tatsuya Ohshima","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5006637021"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":94},"biblio":{"volume":"53","issue":"12","first_page":"694","last_page":"695"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9667999744415283,"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.9667999744415283,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.023800000548362732,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.006599999964237213,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/time-dependent-networks","display_name":"time-dependent networks","score":0.5770000219345093},{"id":"https://openalex.org/keywords/shortest-path-algorithms","display_name":"shortest path algorithms","score":0.6899999976158142}],"concepts":[{"id":"https://openalex.org/C2780297707","wikidata":"https://www.wikidata.org/wiki/Q4895393","display_name":"Landmark","level":2,"score":0.703683078289032},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5882089734077454},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5247169733047485},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.519573450088501},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5017414093017578},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4300578236579895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3416050374507904},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2118282914161682},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14605632424354553},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:2183791707","doi":null,"is_oa":false,"landing_page_url":"https://www-or.amp.i.kyoto-u.ac.jp/members/ohshima/Paper/MThesis/MThesis.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"mag:396897486","doi":null,"is_oa":false,"landing_page_url":"http://ci.nii.ac.jp/naid/110007005007","pdf_url":null,"source":{"id":"https://openalex.org/S4306556686","display_name":"\u30aa\u30da\u30ec\u30fc\u30b7\u30e7\u30f3\u30ba\u30fb\u30ea\u30b5\u30fc\u30c1 : \u7d4c\u55b6\u306e\u79d1\u5b66","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"\u30aa\u30da\u30ec\u30fc\u30b7\u30e7\u30f3\u30ba\u30fb\u30ea\u30b5\u30fc\u30c1 : \u7d4c\u55b6\u306e\u79d1\u5b66","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W30435042","https://openalex.org/W202436597","https://openalex.org/W1493214567","https://openalex.org/W1520740947","https://openalex.org/W1528485123","https://openalex.org/W1557310162","https://openalex.org/W1561240874","https://openalex.org/W1583434898","https://openalex.org/W1599935894","https://openalex.org/W1740620250","https://openalex.org/W1866249310","https://openalex.org/W1969483458","https://openalex.org/W1979750070","https://openalex.org/W1982600687","https://openalex.org/W1985327268","https://openalex.org/W1986652726","https://openalex.org/W1986797609","https://openalex.org/W1998302192","https://openalex.org/W2007687856","https://openalex.org/W2014889099","https://openalex.org/W2084224084","https://openalex.org/W2089338760","https://openalex.org/W2091635795","https://openalex.org/W2094826544","https://openalex.org/W2101778955","https://openalex.org/W2110452945","https://openalex.org/W2110861948","https://openalex.org/W2129154450","https://openalex.org/W2144050074","https://openalex.org/W2144844724","https://openalex.org/W2147219339","https://openalex.org/W2149964853","https://openalex.org/W2150396277","https://openalex.org/W2151400766","https://openalex.org/W2152545366","https://openalex.org/W2155474419","https://openalex.org/W2166542580","https://openalex.org/W2169528473","https://openalex.org/W2184615329","https://openalex.org/W2189110458","https://openalex.org/W2227557434","https://openalex.org/W2261186745","https://openalex.org/W2402598023","https://openalex.org/W2439405256"],"related_works":["https://openalex.org/W7099275752","https://openalex.org/W167710240","https://openalex.org/W7062284144","https://openalex.org/W2807088699","https://openalex.org/W2040712217","https://openalex.org/W2290962274","https://openalex.org/W1199284100","https://openalex.org/W7097729416","https://openalex.org/W2067683633","https://openalex.org/W7095288551"],"abstract_inverted_index":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W396897486","counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}
