{"id":"https://openalex.org/W2866847786","doi":"https://doi.org/10.1145/3221269.3223038","title":"Finding shortest keyword covering routes in road networks","display_name":"Finding shortest keyword covering routes in road networks","publication_year":2018,"publication_date":"2018-07-09","ids":{"openalex":"https://openalex.org/W2866847786","doi":"https://doi.org/10.1145/3221269.3223038","mag":"2866847786"},"language":"en","primary_location":{"id":"doi:10.1145/3221269.3223038","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3221269.3223038","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th International Conference on Scientific and Statistical Database Management","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/A5060973073","display_name":"Vassilis Kaffes","orcid":"https://orcid.org/0009-0007-7529-9018"},"institutions":[{"id":"https://openalex.org/I158716096","display_name":"University of Peloponnese","ror":"https://ror.org/04d4d3c02","country_code":"GR","type":"education","lineage":["https://openalex.org/I158716096"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Vassilis Kaffes","raw_affiliation_strings":["University of the Peloponnese"],"affiliations":[{"raw_affiliation_string":"University of the Peloponnese","institution_ids":["https://openalex.org/I158716096"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052964303","display_name":"Alexandros Belesiotis","orcid":null},"institutions":[{"id":"https://openalex.org/I4210156054","display_name":"Athena Research and Innovation Center In Information Communication & Knowledge Technologies","ror":"https://ror.org/0576by029","country_code":"GR","type":"facility","lineage":["https://openalex.org/I4210156054"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Alexandros Belesiotis","raw_affiliation_strings":["Research Center \"Athena\""],"affiliations":[{"raw_affiliation_string":"Research Center \"Athena\"","institution_ids":["https://openalex.org/I4210156054"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087768208","display_name":"Dimitrios Skoutas","orcid":"https://orcid.org/0000-0002-6118-5227"},"institutions":[{"id":"https://openalex.org/I4210156054","display_name":"Athena Research and Innovation Center In Information Communication & Knowledge Technologies","ror":"https://ror.org/0576by029","country_code":"GR","type":"facility","lineage":["https://openalex.org/I4210156054"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Dimitrios Skoutas","raw_affiliation_strings":["Research Center \"Athena\""],"affiliations":[{"raw_affiliation_string":"Research Center \"Athena\"","institution_ids":["https://openalex.org/I4210156054"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009411092","display_name":"Spiros Skiadopoulos","orcid":"https://orcid.org/0000-0003-3465-8292"},"institutions":[{"id":"https://openalex.org/I158716096","display_name":"University of Peloponnese","ror":"https://ror.org/04d4d3c02","country_code":"GR","type":"education","lineage":["https://openalex.org/I158716096"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Spiros Skiadopoulos","raw_affiliation_strings":["University of the Peloponnese"],"affiliations":[{"raw_affiliation_string":"University of the Peloponnese","institution_ids":["https://openalex.org/I158716096"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5060973073"],"corresponding_institution_ids":["https://openalex.org/I158716096"],"apc_list":null,"apc_paid":null,"fwci":0.1651,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.43446264,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"7","issue":null,"first_page":"1","last_page":"12"},"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/T10757","display_name":"Geographic Information Systems Studies","score":0.9904999732971191,"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"}},{"id":"https://openalex.org/T12016","display_name":"Web Data Mining and Analysis","score":0.9713000059127808,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/skyline","display_name":"Skyline","score":0.8161845803260803},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8070075511932373},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.643599271774292},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6199198961257935},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5944475531578064},{"id":"https://openalex.org/keywords/trips-architecture","display_name":"TRIPS architecture","score":0.5918077826499939},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5491172075271606},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4974863827228546},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3995480537414551},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3343082070350647},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17608210444450378},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.09231284260749817}],"concepts":[{"id":"https://openalex.org/C2780757406","wikidata":"https://www.wikidata.org/wiki/Q465837","display_name":"Skyline","level":2,"score":0.8161845803260803},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8070075511932373},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.643599271774292},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6199198961257935},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5944475531578064},{"id":"https://openalex.org/C157085824","wikidata":"https://www.wikidata.org/wiki/Q2384809","display_name":"TRIPS architecture","level":2,"score":0.5918077826499939},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5491172075271606},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4974863827228546},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3995480537414551},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3343082070350647},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17608210444450378},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.09231284260749817},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3221269.3223038","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3221269.3223038","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th International Conference on Scientific and Statistical Database Management","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G357630818","display_name":null,"funder_award_id":"731581","funder_id":"https://openalex.org/F4320335254","funder_display_name":"Horizon 2020"}],"funders":[{"id":"https://openalex.org/F4320335254","display_name":"Horizon 2020","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W181167209","https://openalex.org/W190901240","https://openalex.org/W1601313669","https://openalex.org/W1829285201","https://openalex.org/W2001625171","https://openalex.org/W2005945380","https://openalex.org/W2014889099","https://openalex.org/W2014979043","https://openalex.org/W2037605480","https://openalex.org/W2041916017","https://openalex.org/W2042313180","https://openalex.org/W2051179753","https://openalex.org/W2078186061","https://openalex.org/W2091492284","https://openalex.org/W2093672773","https://openalex.org/W2107056341","https://openalex.org/W2112513979","https://openalex.org/W2126455549","https://openalex.org/W2143083884","https://openalex.org/W2168148394","https://openalex.org/W2169528473","https://openalex.org/W2215748439","https://openalex.org/W2263919949","https://openalex.org/W2950316186"],"related_works":["https://openalex.org/W848352814","https://openalex.org/W3011256102","https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475"],"abstract_inverted_index":{"Millions":[0],"of":[1,18,45,58,60,62,72,92,112,134,140],"users":[2],"rely":[3],"on":[4,69],"navigation":[5],"applications":[6,20],"to":[7,22,54,84,98,147],"compute":[8,85],"an":[9,116,131],"optimal":[10],"route":[11,27,51],"for":[12,89,101,152],"their":[13],"trips.":[14],"The":[15],"basic":[16],"functionality":[17],"these":[19],"is":[21,52,67],"find":[23],"the":[24,35,49,70,86,90,103,148],"minimum":[25],"cost":[26,124],"between":[28,122],"a":[29,43,56,93,145],"source":[30],"and":[31,80,96,125],"target":[32],"node":[33],"in":[34],"transportation":[36],"network.":[37],"In":[38],"this":[39,46,78,113,153],"paper,":[40],"we":[41,81,129],"address":[42],"variant":[44],"problem,":[47],"where":[48],"computed":[50],"required":[53],"contain":[55],"set":[57],"Points":[59],"Interest":[61],"specific":[63],"types.":[64],"Our":[65],"approach":[66,136],"based":[68],"concept":[71],"keyword":[73,87,105],"skyline.":[74],"We":[75,108],"formally":[76],"define":[77],"concept,":[79],"show":[82],"how":[83,97],"skyline":[88],"vertices":[91],"given":[94],"network":[95],"use":[99],"it":[100],"computing":[102],"shortest":[104],"covering":[106],"paths.":[107],"present":[109,130],"different":[110,120,141],"variants":[111],"method,":[114],"including":[115,143],"approximation":[117],"algorithm,":[118],"providing":[119],"trade-offs":[121],"preprocessing":[123],"execution":[126],"time.":[127],"Finally,":[128],"experimental":[132],"evaluation":[133],"our":[135],"using":[137],"real-world":[138],"datasets":[139],"sizes,":[142],"also":[144],"comparison":[146],"current":[149],"state-of-the-art":[150],"algorithm":[151],"problem.":[154]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}