{"id":"https://openalex.org/W4375865651","doi":"https://doi.org/10.1145/3596601","title":"Distance, Origin and Category Constrained Paths","display_name":"Distance, Origin and Category Constrained Paths","publication_year":2023,"publication_date":"2023-05-08","ids":{"openalex":"https://openalex.org/W4375865651","doi":"https://doi.org/10.1145/3596601"},"language":"en","primary_location":{"id":"doi:10.1145/3596601","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3596601","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3596601","source":{"id":"https://openalex.org/S2503711797","display_name":"ACM Transactions on Spatial Algorithms and Systems","issn_l":"2374-0353","issn":["2374-0353","2374-0361"],"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":"ACM Transactions on Spatial Algorithms and Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3596601","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044010038","display_name":"Teng Xu","orcid":"https://orcid.org/0000-0002-5169-1425"},"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":"Xu Teng","raw_affiliation_strings":["Electrical and Computer Engineering, Iowa State University, USA"],"raw_orcid":"https://orcid.org/0000-0002-5169-1425","affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, Iowa State University, USA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086447943","display_name":"Goce Trajcevski","orcid":"https://orcid.org/0000-0002-8839-6278"},"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":"Goce Trajcevski","raw_affiliation_strings":["Electrical and Computer Engineering, Iowa State University, USA"],"raw_orcid":"https://orcid.org/0000-0002-8839-6278","affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, Iowa State University, USA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017299501","display_name":"Andreas Z\u00fcfle","orcid":"https://orcid.org/0000-0001-7001-4123"},"institutions":[{"id":"https://openalex.org/I150468666","display_name":"Emory University","ror":"https://ror.org/03czfpz43","country_code":"US","type":"education","lineage":["https://openalex.org/I150468666"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andreas Z\u00fcfle","raw_affiliation_strings":["Computer Science, Emory University, USA"],"raw_orcid":"https://orcid.org/0000-0001-7001-4123","affiliations":[{"raw_affiliation_string":"Computer Science, Emory University, USA","institution_ids":["https://openalex.org/I150468666"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5219,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.59749277,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"9","issue":"3","first_page":"1","last_page":"27"},"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/T10203","display_name":"Recommender Systems and Techniques","score":0.9929999709129333,"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"}},{"id":"https://openalex.org/T10757","display_name":"Geographic Information Systems Studies","score":0.9890000224113464,"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.7993239164352417},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.6662766933441162},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6222333908081055},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5873986482620239},{"id":"https://openalex.org/keywords/point-of-interest","display_name":"Point of interest","score":0.5850305557250977},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5841857194900513},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.5121345520019531},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.4491245746612549},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4261952042579651},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.34357184171676636},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16608044505119324},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1492862105369568},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08646762371063232}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7993239164352417},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.6662766933441162},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6222333908081055},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5873986482620239},{"id":"https://openalex.org/C150140777","wikidata":"https://www.wikidata.org/wiki/Q960648","display_name":"Point of interest","level":2,"score":0.5850305557250977},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5841857194900513},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.5121345520019531},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.4491245746612549},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4261952042579651},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.34357184171676636},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16608044505119324},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1492862105369568},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08646762371063232},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3596601","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3596601","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3596601","source":{"id":"https://openalex.org/S2503711797","display_name":"ACM Transactions on Spatial Algorithms and Systems","issn_l":"2374-0353","issn":["2374-0353","2374-0361"],"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":"ACM Transactions on Spatial Algorithms and Systems","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3596601","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3596601","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3596601","source":{"id":"https://openalex.org/S2503711797","display_name":"ACM Transactions on Spatial Algorithms and Systems","issn_l":"2374-0353","issn":["2374-0353","2374-0361"],"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":"ACM Transactions on Spatial Algorithms and Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1263641586","display_name":null,"funder_award_id":"CCF-1637541","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3906301439","display_name":"AitF: Collaborative Research: Modeling movement on transportation networks using uncertain data","funder_award_id":"1637541","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7297042243","display_name":"Collaborative Research: SWIFT: LARGE: Dynamics and Security Aware Predictive Spectrum Sharing with Active and Passive Users","funder_award_id":"2030249","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4375865651.pdf","grobid_xml":"https://content.openalex.org/works/W4375865651.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W1519440323","https://openalex.org/W1962871885","https://openalex.org/W1972436494","https://openalex.org/W1991482408","https://openalex.org/W2025605741","https://openalex.org/W2028031999","https://openalex.org/W2066356146","https://openalex.org/W2103406514","https://openalex.org/W2104265756","https://openalex.org/W2106642566","https://openalex.org/W2107056341","https://openalex.org/W2149964853","https://openalex.org/W2160080073","https://openalex.org/W2343086240","https://openalex.org/W2728796024","https://openalex.org/W2748880077","https://openalex.org/W2889079547","https://openalex.org/W2898408330","https://openalex.org/W2901911814","https://openalex.org/W2918100086","https://openalex.org/W2945407949","https://openalex.org/W2997875411","https://openalex.org/W3002265191","https://openalex.org/W3008578452","https://openalex.org/W3048313355","https://openalex.org/W3146968547","https://openalex.org/W3212588087","https://openalex.org/W4282932207","https://openalex.org/W4299710108","https://openalex.org/W4302796358","https://openalex.org/W4313054664","https://openalex.org/W6657543545","https://openalex.org/W6881285302"],"related_works":["https://openalex.org/W2348101466","https://openalex.org/W1991645216","https://openalex.org/W2188505374","https://openalex.org/W2413339343","https://openalex.org/W2357241418","https://openalex.org/W3140834074","https://openalex.org/W1988809668","https://openalex.org/W2360627962","https://openalex.org/W2949085007","https://openalex.org/W4302609101"],"abstract_inverted_index":{"Recommending":[0],"a":[1,7,71,89,97,114,121,136,145],"Point":[2],"of":[3,9,22,27,58,88,108,124,132,179],"Interest":[4],"(PoI)":[5],"or":[6,46],"sequence":[8],"PoIs":[10,119],"to":[11,70],"visit":[12],"based":[13,159],"on":[14,55,102,144,160],"user\u2019s":[15],"preferences":[16],"and":[17,80,116,163],"geo-locations":[18],"has":[19],"been":[20,34],"one":[21,107],"the":[23,53,56,59,86,109,130,177,180],"most":[24],"popular":[25],"applications":[26],"Location-Based":[28],"Services":[29],"(LBS).":[30],"Variants":[31],"have":[32],"also":[33],"considered":[35],"which":[36,84],"take":[37],"other":[38],"factors":[39],"into":[40],"consideration,":[41],"such":[42,135],"as":[43,50,52],"broader":[44],"(implicit":[45],"explicit)":[47],"semantic":[48],"constraints":[49],"well":[51],"limitations":[54],"length":[57],"trip.":[60],"In":[61],"this":[62],"work,":[63],"we":[64,149],"present":[65],"an":[66,140],"efficient":[67,152],"algorithmic":[68],"solution":[69],"novel":[72,146],"query":[73,157],"\u2013":[74,83],"PaDOC":[75,156],"(Paths":[76],"with":[77],"Distance,":[78],"Origin,":[79],"Category":[81],"constraints)":[82],"combines":[85],"generation":[87],"path":[90,137],"that":[91,129],"(a)":[92],"can":[93],"be":[94],"traversed":[95],"within":[96],"user-specified":[98,110,122],"budget":[99],"(e.g.,":[100,113],"limit":[101],"distance),":[103],"(b)":[104],"starts":[105],"at":[106],"origin":[111],"locations":[112],"hotel),":[115],"(c)":[117],"contains":[118],"from":[120],"list":[123],"PoI":[125],"categories.":[126],"We":[127,167],"show":[128],"problem":[131],"deciding":[133],"whether":[134],"exists":[138],"is":[139],"NP-hard":[141],"problem.":[142],"Based":[143],"indexing":[147],"structure,":[148],"propose":[150],"two":[151],"algorithms":[153],"for":[154],"approximate":[155],"processing":[158],"both":[161],"conservative":[162],"progressive":[164],"distance":[165],"estimations.":[166],"conducted":[168],"extensive":[169],"experiments":[170],"over":[171,183],"real,":[172],"publicly":[173],"available":[174],"datasets,":[175],"demonstrating":[176],"benefits":[178],"proposed":[181],"methodologies":[182],"straightforward":[184],"solutions.":[185]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}