{"id":"https://openalex.org/W4313054664","doi":"https://doi.org/10.14778/3551793.3551863","title":"Diversified top- <i>k</i> route planning in road network","display_name":"Diversified top- <i>k</i> route planning in road network","publication_year":2022,"publication_date":"2022-07-01","ids":{"openalex":"https://openalex.org/W4313054664","doi":"https://doi.org/10.14778/3551793.3551863"},"language":"en","primary_location":{"id":"doi:10.14778/3551793.3551863","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3551793.3551863","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-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/A5045028640","display_name":"Zihan Luo","orcid":"https://orcid.org/0000-0002-7142-448X"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Zihan Luo","raw_affiliation_strings":["The Hong Kong University of Science and Technology, Hong Kong SAR, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Hong Kong University of Science and Technology, Hong Kong SAR, China","institution_ids":["https://openalex.org/I200769079"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011172578","display_name":"Lei Li","orcid":"https://orcid.org/0000-0002-1386-767X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lei Li","raw_affiliation_strings":["The Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020737490","display_name":"Mengxuan Zhang","orcid":"https://orcid.org/0000-0001-8155-4942"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mengxuan Zhang","raw_affiliation_strings":["Iowa State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Iowa State University","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004652254","display_name":"Wen Hua","orcid":"https://orcid.org/0000-0001-5456-7035"},"institutions":[{"id":"https://openalex.org/I165143802","display_name":"The University of Queensland","ror":"https://ror.org/00rqy9422","country_code":"AU","type":"education","lineage":["https://openalex.org/I165143802"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Wen Hua","raw_affiliation_strings":["The University of Queensland, Brisbane, QLD, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Queensland, Brisbane, QLD, Australia","institution_ids":["https://openalex.org/I165143802"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007133865","display_name":"Yehong Xu","orcid":"https://orcid.org/0000-0002-5046-5311"},"institutions":[{"id":"https://openalex.org/I165143802","display_name":"The University of Queensland","ror":"https://ror.org/00rqy9422","country_code":"AU","type":"education","lineage":["https://openalex.org/I165143802"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Yehong Xu","raw_affiliation_strings":["The University of Queensland, Brisbane, QLD, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Queensland, Brisbane, QLD, Australia","institution_ids":["https://openalex.org/I165143802"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011384237","display_name":"Xiaofang Zhou","orcid":"https://orcid.org/0000-0001-6343-1455"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiaofang Zhou","raw_affiliation_strings":["The Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.1006,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.9509424,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":"15","issue":"11","first_page":"3199","last_page":"3212"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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":"Advanced Database Systems and Queries","score":0.9847999811172485,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9735000133514404,"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/tree-traversal","display_name":"Tree traversal","score":0.7073851823806763},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.69178307056427},{"id":"https://openalex.org/keywords/concatenation","display_name":"Concatenation (mathematics)","score":0.6861602067947388},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.6839138269424438},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.6213237047195435},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.537083089351654},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5320597290992737},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5132064819335938},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5113949179649353},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47816070914268494},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39062678813934326},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22490215301513672}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7073851823806763},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.69178307056427},{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.6861602067947388},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6839138269424438},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.6213237047195435},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.537083089351654},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5320597290992737},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5132064819335938},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5113949179649353},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47816070914268494},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39062678813934326},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22490215301513672},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"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":2,"locations":[{"id":"doi:10.14778/3551793.3551863","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3551793.3551863","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-121091","is_oa":false,"landing_page_url":"http://www.scopus.com/record/display.url?eid=2-s2.0-85137999320&origin=inward","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W197429550","https://openalex.org/W1877059518","https://openalex.org/W1936915774","https://openalex.org/W1972314457","https://openalex.org/W1977943748","https://openalex.org/W2005945380","https://openalex.org/W2008003976","https://openalex.org/W2008223526","https://openalex.org/W2011282943","https://openalex.org/W2024524720","https://openalex.org/W2037403365","https://openalex.org/W2051382614","https://openalex.org/W2052120747","https://openalex.org/W2058821164","https://openalex.org/W2115589427","https://openalex.org/W2122867585","https://openalex.org/W2142311862","https://openalex.org/W2149742236","https://openalex.org/W2173413334","https://openalex.org/W2186094217","https://openalex.org/W2244843312","https://openalex.org/W2296055404","https://openalex.org/W2340222647","https://openalex.org/W2522844978","https://openalex.org/W2564443285","https://openalex.org/W2607294481","https://openalex.org/W2753481197","https://openalex.org/W2770729327","https://openalex.org/W2789836371","https://openalex.org/W2795273206","https://openalex.org/W2798620495","https://openalex.org/W2808374365","https://openalex.org/W2889125237","https://openalex.org/W2890426256","https://openalex.org/W2952499930","https://openalex.org/W2967996808","https://openalex.org/W2987583674","https://openalex.org/W3010833690","https://openalex.org/W3032255305","https://openalex.org/W3032745867","https://openalex.org/W3043414321","https://openalex.org/W3095847410","https://openalex.org/W3104420037","https://openalex.org/W3174212678","https://openalex.org/W3198197820","https://openalex.org/W3212378323","https://openalex.org/W6633514799"],"related_works":["https://openalex.org/W2200188075","https://openalex.org/W4230405657","https://openalex.org/W4254594467","https://openalex.org/W4252596799","https://openalex.org/W244044452","https://openalex.org/W2552915643","https://openalex.org/W170547082","https://openalex.org/W3213135344","https://openalex.org/W3183956626","https://openalex.org/W2132731123"],"abstract_inverted_index":{"Route":[0],"planning":[1],"is":[2,71,85],"ubiquitous":[3],"and":[4,99,119,129,142,160],"has":[5],"a":[6,65,121,131],"profound":[7],"impact":[8],"on":[9,37,79,152],"our":[10,163],"daily":[11],"life.":[12],"However,":[13,73],"the":[14,38,48,52,74,80,104,116,140,148,153,158,166],"existing":[15],"path":[16,109,117,122],"algorithms":[17],"tend":[18],"to":[19,88,102,134,145],"produce":[20],"similar":[21,24],"paths":[22,54],"between":[23,55],"OD":[25,57],"(Origin-Destination)":[26],"pairs":[27],"because":[28],"they":[29],"optimize":[30],"query":[31,149],"results":[32],"without":[33],"considering":[34],"their":[35,61,68],"influence":[36],"whole":[39],"network,":[40],"which":[41,84],"further":[42,146],"introduces":[43],"congestions.":[44],"Therefore,":[45,92],"we":[46,93,113,138],"investigate":[47],"problem":[49],"of":[50,162],"diversifying":[51],"top-k":[53],"an":[56,96],"pair":[58],"such":[59],"that":[60],"similarities":[62],"are":[63],"under":[64],"threshold":[66],"while":[67],"total":[69],"length":[70],"minimal.":[72],"current":[75],"solutions":[76,144],"all":[77],"depend":[78],"expensive":[81,105],"graph":[82,106],"traversal":[83],"too":[86],"slow":[87],"apply":[89],"in":[90,108],"practice.":[91],"first":[94],"propose":[95,120,130],"edge":[97],"deviation":[98],"concatenation-based":[100],"method":[101,125],"avoid":[103],"search":[107],"enumeration.":[110],"After":[111],"that,":[112],"dive":[114],"into":[115],"relations":[118],"similarity":[123],"computation":[124],"with":[126],"constant":[127],"complexity,":[128],"pruning":[132],"technique":[133],"improve":[135],"efficiency.":[136],"Finally,":[137],"provide":[139],"completeness":[141],"efficiency-oriented":[143],"accelerate":[147],"answering.":[150],"Evaluations":[151],"real-life":[154],"road":[155],"networks":[156],"demonstrate":[157],"effectiveness":[159],"efficiency":[161],"algorithm":[164],"over":[165],"state-of-the-art.":[167]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":7}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}