{"id":"https://openalex.org/W1916990376","doi":"https://doi.org/10.1007/978-3-319-22363-6_15","title":"A Spatio-Temporally Opportunistic Approach to Best-Start-Time Lagrangian Shortest Path","display_name":"A Spatio-Temporally Opportunistic Approach to Best-Start-Time Lagrangian Shortest Path","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1916990376","doi":"https://doi.org/10.1007/978-3-319-22363-6_15","mag":"1916990376"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-22363-6_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-22363-6_15","pdf_url":null,"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/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"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/A5077535139","display_name":"Sarnath Ramnath","orcid":null},"institutions":[{"id":"https://openalex.org/I173963315","display_name":"St. Cloud State University","ror":"https://ror.org/016czhx14","country_code":"US","type":"education","lineage":["https://openalex.org/I173963315","https://openalex.org/I91221267"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sarnath Ramnath","raw_affiliation_strings":["Computer Science and Information Technology, St. Cloud State University, St. Cloud, MN, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Information Technology, St. Cloud State University, St. Cloud, MN, USA","institution_ids":["https://openalex.org/I173963315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021681759","display_name":"Zhe Jiang","orcid":"https://orcid.org/0000-0002-3576-6976"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhe Jiang","raw_affiliation_strings":["Computer Science and Engineering, University of Minnesota, Minneapolis, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, University of Minnesota, Minneapolis, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006611007","display_name":"Hsuan-Heng Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Hsuan-Heng Wu","raw_affiliation_strings":["Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036993630","display_name":"Venkata M. V. Gunturi","orcid":"https://orcid.org/0000-0002-0676-0241"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Venkata M. V. Gunturi","raw_affiliation_strings":["Computer Science and Engineering, University of Minnesota, Minneapolis, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, University of Minnesota, Minneapolis, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102940260","display_name":"Shashi Shekhar","orcid":"https://orcid.org/0000-0002-3191-3879"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shashi Shekhar","raw_affiliation_strings":["Computer Science and Engineering, University of Minnesota, Minneapolis, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, University of Minnesota, Minneapolis, USA","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5077535139"],"corresponding_institution_ids":["https://openalex.org/I173963315"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.4315,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.54203057,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"274","last_page":"291"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"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":"Data Management and Algorithms","score":0.9997000098228455,"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/T11980","display_name":"Human Mobility and Location-Based Analysis","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9991999864578247,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.785935640335083},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7146443724632263},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5944719314575195},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5342124700546265},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5219073295593262},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5167436003684998},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5024237632751465},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4978611469268799},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.48403090238571167},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.47565504908561707},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3800724744796753},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3531954884529114},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.26155394315719604},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22241386771202087},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21836692094802856},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0672561526298523}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.785935640335083},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7146443724632263},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5944719314575195},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5342124700546265},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5219073295593262},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5167436003684998},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5024237632751465},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4978611469268799},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.48403090238571167},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.47565504908561707},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3800724744796753},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3531954884529114},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.26155394315719604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22241386771202087},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21836692094802856},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0672561526298523},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-22363-6_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-22363-6_15","pdf_url":null,"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/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W143506948","https://openalex.org/W1599935894","https://openalex.org/W1788719447","https://openalex.org/W1971561869","https://openalex.org/W1979007597","https://openalex.org/W1980384232","https://openalex.org/W1986652726","https://openalex.org/W2009303970","https://openalex.org/W2031674781","https://openalex.org/W2033303316","https://openalex.org/W2104724137","https://openalex.org/W2109923933","https://openalex.org/W2111160151","https://openalex.org/W2121103519","https://openalex.org/W2134780295","https://openalex.org/W2137073837","https://openalex.org/W2149742236","https://openalex.org/W2150928468","https://openalex.org/W2156301108","https://openalex.org/W2166236009","https://openalex.org/W2222731506","https://openalex.org/W2614696754","https://openalex.org/W2752573522","https://openalex.org/W3145128584","https://openalex.org/W4250131469","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W2156431668","https://openalex.org/W2767202586","https://openalex.org/W4293054712","https://openalex.org/W2388410942","https://openalex.org/W2353519994","https://openalex.org/W2018146256","https://openalex.org/W2030169809","https://openalex.org/W2365712669"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}