{"id":"https://openalex.org/W2142196401","doi":"https://doi.org/10.1145/1653771.1653803","title":"Monitoring minimum cost paths on road networks","display_name":"Monitoring minimum cost paths on road networks","publication_year":2009,"publication_date":"2009-11-04","ids":{"openalex":"https://openalex.org/W2142196401","doi":"https://doi.org/10.1145/1653771.1653803","mag":"2142196401"},"language":"en","primary_location":{"id":"doi:10.1145/1653771.1653803","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1653771.1653803","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","raw_type":"proceedings-article"},"type":"article","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/A5100716458","display_name":"Yuan Tian","orcid":"https://orcid.org/0000-0002-6435-564X"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yuan Tian","raw_affiliation_strings":["The Pennsylvania State University, University Park, PA","THE PENNSYLVANIA STATE UNIVERSITY, UNIVERSITY PARK, PA"],"affiliations":[{"raw_affiliation_string":"The Pennsylvania State University, University Park, PA","institution_ids":["https://openalex.org/I130769515"]},{"raw_affiliation_string":"THE PENNSYLVANIA STATE UNIVERSITY, UNIVERSITY PARK, PA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083908579","display_name":"Ken C. K. Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ken C. K. Lee","raw_affiliation_strings":["The Pennsylvania State University, University Park, PA","THE PENNSYLVANIA STATE UNIVERSITY, UNIVERSITY PARK, PA"],"affiliations":[{"raw_affiliation_string":"The Pennsylvania State University, University Park, PA","institution_ids":["https://openalex.org/I130769515"]},{"raw_affiliation_string":"THE PENNSYLVANIA STATE UNIVERSITY, UNIVERSITY PARK, PA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091716232","display_name":"Wang-Chien Lee","orcid":"https://orcid.org/0000-0002-8949-489X"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wang-Chien Lee","raw_affiliation_strings":["The Pennsylvania State University, University Park, PA","THE PENNSYLVANIA STATE UNIVERSITY, UNIVERSITY PARK, PA"],"affiliations":[{"raw_affiliation_string":"The Pennsylvania State University, University Park, PA","institution_ids":["https://openalex.org/I130769515"]},{"raw_affiliation_string":"THE PENNSYLVANIA STATE UNIVERSITY, UNIVERSITY PARK, PA","institution_ids":["https://openalex.org/I130769515"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100716458"],"corresponding_institution_ids":["https://openalex.org/I130769515"],"apc_list":null,"apc_paid":null,"fwci":1.7623,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.84927615,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"217","last_page":"226"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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.989300012588501,"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/path","display_name":"Path (computing)","score":0.8065990805625916},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7840704917907715},{"id":"https://openalex.org/keywords/scope","display_name":"Scope (computer science)","score":0.6812378168106079},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4841483235359192},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.46216392517089844},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3233851194381714},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3022838830947876},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.29571232199668884},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2637406885623932},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18118694424629211}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.8065990805625916},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7840704917907715},{"id":"https://openalex.org/C2778012447","wikidata":"https://www.wikidata.org/wiki/Q1034415","display_name":"Scope (computer science)","level":2,"score":0.6812378168106079},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4841483235359192},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.46216392517089844},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3233851194381714},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3022838830947876},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.29571232199668884},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2637406885623932},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18118694424629211},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1653771.1653803","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1653771.1653803","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5600000023841858,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G7661259866","display_name":null,"funder_award_id":"IIS-0328881IIS-0534343CNS-0626709","funder_id":"https://openalex.org/F4320337388","funder_display_name":"Division of Computer and Network Systems"},{"id":"https://openalex.org/G8754469260","display_name":null,"funder_award_id":"IIS-0328881IIS-0534343CNS-0626709","funder_id":"https://openalex.org/F4320337389","funder_display_name":"Division of Information and Intelligent Systems"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337388","display_name":"Division of Computer and Network Systems","ror":"https://ror.org/02rdzmk74"},{"id":"https://openalex.org/F4320337389","display_name":"Division of Information and Intelligent Systems","ror":"https://ror.org/053a2cp42"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1519770485","https://openalex.org/W1772840905","https://openalex.org/W2007572995","https://openalex.org/W2052504823","https://openalex.org/W2061208844","https://openalex.org/W2066582699","https://openalex.org/W2091635795","https://openalex.org/W2096725637","https://openalex.org/W2109121434","https://openalex.org/W2111160151","https://openalex.org/W2131237536","https://openalex.org/W2134634502","https://openalex.org/W2135810626","https://openalex.org/W2149742236","https://openalex.org/W2150519657","https://openalex.org/W2154356512","https://openalex.org/W2166739719","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W4229964816"],"related_works":["https://openalex.org/W2183638083","https://openalex.org/W2119138398","https://openalex.org/W2037384153","https://openalex.org/W2306351532","https://openalex.org/W2598979711","https://openalex.org/W2116465486","https://openalex.org/W830396839","https://openalex.org/W3196508834","https://openalex.org/W2490317825","https://openalex.org/W2171940562"],"abstract_inverted_index":{"On":[0],"a":[1,14,18,21,51,134,150,163],"road":[2,52,77],"network,":[3],"the":[4,24,44,85,126,159,178],"minimum":[5],"cost":[6,27],"path":[7,10,22,35,87,92,100,108,120,144,152,179,182],"(or":[8],"min-cost":[9,34,48,73,86,96],"for":[11,71,117],"short)":[12],"from":[13],"source":[15],"location":[16],"to":[17,99,141,156,174],"destination":[19],"is":[20,58,139],"with":[23,114],"smallest":[25],"travel":[26],"among":[28],"all":[29],"possible":[30],"paths.":[31,161],"Despite":[32],"that":[33,94,110],"queries":[36,101],"on":[37,50,132,177],"static":[38],"networks":[39],"have":[40],"been":[41],"well":[42],"studied,":[43],"problem":[45],"of":[46,56,84,128],"monitoring":[47,72,88],"paths":[49,74,97,113],"network":[53,104],"in":[54,75],"presence":[55],"updates":[57],"not":[59],"fully":[60],"explored.":[61],"In":[62],"this":[63],"paper,":[64],"we":[65,124,148],"present":[66],"PathMon,":[67],"an":[68],"efficient":[69],"system":[70],"dynamic":[76],"networks.":[78],"PathMon":[79],"addresses":[80],"two":[81],"important":[82],"issues":[83],"problem,":[89],"namely,":[90],"(i)":[91],"invalidation":[93,180],"identifies":[95],"returned":[98],"affected":[102,119,143],"by":[103,167],"changes,":[105],"and":[106,170,181],"(ii)":[107],"update":[109,183],"replaces":[111],"invalid":[112],"new":[115],"ones":[116],"those":[118],"queries.":[121,145],"For":[122,146],"(i),":[123],"introduce":[125],"notion":[127],"query":[129,135],"scope,":[130],"based":[131],"which":[133],"scope":[136],"index":[137],"(QSI)":[138],"developed":[140],"identify":[142],"(ii),":[147],"devise":[149],"partial":[151],"computation":[153],"algorithm":[154],"(PPCA)":[155],"quickly":[157],"recompute":[158],"updated":[160],"Through":[162],"comprehensive":[164],"performance":[165],"evaluation":[166],"simulation,":[168],"QSI":[169],"PPCA":[171],"are":[172],"demonstrated":[173],"be":[175],"effective":[176],"issues.":[184]},"counts_by_year":[{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}