{"id":"https://openalex.org/W2072485026","doi":"https://doi.org/10.1145/1989323.1989368","title":"On k-skip shortest paths","display_name":"On k-skip shortest paths","publication_year":2011,"publication_date":"2011-06-12","ids":{"openalex":"https://openalex.org/W2072485026","doi":"https://doi.org/10.1145/1989323.1989368","mag":"2072485026"},"language":"en","primary_location":{"id":"doi:10.1145/1989323.1989368","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1989323.1989368","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 ACM SIGMOD International Conference on Management of data","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/A5048609852","display_name":"Yufei Tao","orcid":"https://orcid.org/0000-0003-3883-5452"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yufei Tao","raw_affiliation_strings":["Chinese University of Hong Kong, Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Chinese University of Hong Kong, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102846935","display_name":"Cheng Sheng","orcid":"https://orcid.org/0000-0002-2656-6147"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Cheng Sheng","raw_affiliation_strings":["Chinese University of Hong Kong, Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Chinese University of Hong Kong, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062247330","display_name":"Jian Pei","orcid":"https://orcid.org/0000-0002-2200-8711"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Jian Pei","raw_affiliation_strings":["Simon Fraser University, Burnaby, Canada","( Simon Fraser University Burnaby Canada )"],"affiliations":[{"raw_affiliation_string":"Simon Fraser University, Burnaby, Canada","institution_ids":["https://openalex.org/I18014758"]},{"raw_affiliation_string":"( Simon Fraser University Burnaby Canada )","institution_ids":["https://openalex.org/I18014758"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5048609852"],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":6.551,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.97358319,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"421","last_page":"432"},"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/T13282","display_name":"Automated Road and Building Extraction","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/T10757","display_name":"Geographic Information Systems Studies","score":0.9836000204086304,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"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/computer-science","display_name":"Computer science","score":0.5736926198005676},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.45959576964378357},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.44815149903297424},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2661491632461548},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1017572283744812}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5736926198005676},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.45959576964378357},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.44815149903297424},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2661491632461548},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1017572283744812}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1989323.1989368","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1989323.1989368","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 ACM SIGMOD International Conference on Management of data","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.229.3534","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.229.3534","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.sfu.ca/%7Ejpei/publications/K-skip-SIGMOD11.pdf","raw_type":"text"},{"id":"pmh:oai:espace.library.uq.edu.au:UQ:607290","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402388","display_name":"Queensland's institutional digital repository (The University of Queensland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I165143802","host_organization_name":"The University of Queensland","host_organization_lineage":["https://openalex.org/I165143802"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.5699999928474426}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W30435042","https://openalex.org/W1493214567","https://openalex.org/W1583434898","https://openalex.org/W1965469937","https://openalex.org/W1969483458","https://openalex.org/W1996865658","https://openalex.org/W1996936086","https://openalex.org/W2002722727","https://openalex.org/W2002838096","https://openalex.org/W2014789398","https://openalex.org/W2014889099","https://openalex.org/W2041172083","https://openalex.org/W2053923031","https://openalex.org/W2054459484","https://openalex.org/W2098636939","https://openalex.org/W2099083325","https://openalex.org/W2102842495","https://openalex.org/W2114734373","https://openalex.org/W2120424341","https://openalex.org/W2131237536","https://openalex.org/W2140883685","https://openalex.org/W2148831787","https://openalex.org/W2149964853","https://openalex.org/W2154356512","https://openalex.org/W2169528473","https://openalex.org/W2171901130","https://openalex.org/W2172107427","https://openalex.org/W2575116237","https://openalex.org/W3004540582","https://openalex.org/W3019365222","https://openalex.org/W3145128584","https://openalex.org/W4244850198","https://openalex.org/W4285719527","https://openalex.org/W4390575860"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2767202586","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2161960576","https://openalex.org/W2349797546","https://openalex.org/W2366342492"],"abstract_inverted_index":{"Given":[0],"two":[1,113],"vertices":[2,26,52,65],"s,":[3],"t":[4],"in":[5,27,53,66,82,102,120,138],"a":[6,22,32,45,69,79,148,167],"graph,":[7],"let":[8],"P":[9,20,29,57,61,67,77,90],"be":[10],"the":[11,25,64,103,135,142,156,164,176,179],"shortest":[12,34],"path":[13,35],"(SP)":[14],"from":[15,36],"s":[16,37],"to":[17,38,127],"t,":[18,39],"and":[19],"\u22c6":[21,30,58,78],"subset":[23],"of":[24,48,71,89,105,166,178],"P.":[28,54],"is":[31,91,125,145],"k-skip":[33,99,129,180],"if":[40],"it":[41],"includes":[42],"at":[43,72],"least":[44,73],"vertex":[46,88],"out":[47],"every":[49,86],"k":[50],"consecutive":[51],"In":[55],"general,":[56],"succinctly":[59],"describes":[60],"by":[62,188],"sampling":[63],"with":[68,147,191],"rate":[70],"1/k.":[74],"This":[75,96],"makes":[76],"natural":[80],"substitute":[81],"scenarios":[83],"where":[84],"reporting":[85],"single":[87],"unnecessary":[92],"or":[93],"even":[94],"undesired.":[95],"paper":[97],"studies":[98],"SP":[100,181],"computation":[101],"context":[104],"spatial":[106],"network":[107],"databases":[108],"(SNDB).":[109],"Our":[110],"technique":[111],"has":[112,185],"properties":[114],"crucial":[115],"for":[116],"real-time":[117],"query":[118],"processing":[119],"SNDB.":[121],"First,":[122],"our":[123],"solution":[124],"able":[126],"answer":[128],"queries":[130],"significantly":[131],"faster":[132],"than":[133,154],"finding":[134],"original":[136],"SPs":[137],"their":[139],"entirety.":[140],"Second,":[141],"previous":[143],"objective":[144],"achieved":[146],"structure":[149],"that":[150,171],"occupies":[151],"less":[152],"space":[153],"storing":[155],"underlying":[157],"road":[158],"network.":[159],"The":[160],"proposed":[161],"algorithms":[162],"are":[163],"outcome":[165],"careful":[168],"theoretical":[169],"analysis":[170],"reveals":[172],"valuable":[173],"insight":[174],"into":[175],"characteristics":[177],"problem.":[182],"Their":[183],"efficiency":[184],"been":[186],"confirmed":[187],"extensive":[189],"experiments":[190],"real":[192],"data.":[193]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}