{"id":"https://openalex.org/W4413948892","doi":"https://doi.org/10.14778/3746405.3746440","title":"Beyond Shortest Paths: Node Fairness in Route Recommendation","display_name":"Beyond Shortest Paths: Node Fairness in Route Recommendation","publication_year":2025,"publication_date":"2025-05-01","ids":{"openalex":"https://openalex.org/W4413948892","doi":"https://doi.org/10.14778/3746405.3746440"},"language":"en","primary_location":{"id":"doi:10.14778/3746405.3746440","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3746405.3746440","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":true,"oa_status":"green","oa_url":"https://upcommons.upc.edu/bitstreams/a97bf627-996c-4fd2-aca2-a54c9633013d/download","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114377746","display_name":"Antonio Ferrara","orcid":"https://orcid.org/0000-0002-0784-1115"},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]},{"id":"https://openalex.org/I4210149628","display_name":"TeleConsult Austria (Austria)","ror":"https://ror.org/04zddqw39","country_code":"AT","type":"company","lineage":["https://openalex.org/I4210149628"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Antonio Ferrara","raw_affiliation_strings":["CENTAI, Turin, Italy and TU Graz, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CENTAI, Turin, Italy and TU Graz, Austria","institution_ids":["https://openalex.org/I4092182","https://openalex.org/I4210149628"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010392760","display_name":"David Garc\u00eda-Soriano","orcid":"https://orcid.org/0000-0002-2869-9330"},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"David Garc\u00eda-Soriano","raw_affiliation_strings":["Universitat Polit\u00e8cnica de Catalunya, Serra H\u00fanter Fellow, Barcelona, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universitat Polit\u00e8cnica de Catalunya, Serra H\u00fanter Fellow, Barcelona, Spain","institution_ids":["https://openalex.org/I9617848"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022272025","display_name":"Francesco Bonchi","orcid":"https://orcid.org/0000-0001-9464-8315"},"institutions":[{"id":"https://openalex.org/I134940468","display_name":"Institute for Scientific Interchange","ror":"https://ror.org/00te2x188","country_code":"IT","type":"facility","lineage":["https://openalex.org/I134940468"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Francesco Bonchi","raw_affiliation_strings":["CENTAI, Turin, Italy and Eurecat, Barcelona, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CENTAI, Turin, Italy and Eurecat, Barcelona, Spain","institution_ids":["https://openalex.org/I134940468"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7772,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.77763004,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"18","issue":"9","first_page":"3230","last_page":"3242"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9869999885559082,"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/T11106","display_name":"Data Management and Algorithms","score":0.9860000014305115,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6987507343292236},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6195935606956482},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5958361625671387},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4981248378753662},{"id":"https://openalex.org/keywords/business","display_name":"Business","score":0.3316977024078369},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22095611691474915},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09433627128601074},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09297344088554382}],"concepts":[{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6987507343292236},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6195935606956482},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5958361625671387},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4981248378753662},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.3316977024078369},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22095611691474915},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09433627128601074},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09297344088554382},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.14778/3746405.3746440","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3746405.3746440","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:upcommons.upc.edu:2117/441585","is_oa":true,"landing_page_url":"https://hdl.handle.net/2117/441585","pdf_url":"https://upcommons.upc.edu/bitstreams/a97bf627-996c-4fd2-aca2-a54c9633013d/download","source":{"id":"https://openalex.org/S4377196262","display_name":"UPCommons institutional repository (Universitat Polit\u00e8cnica de Catalunya)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9617848","host_organization_name":"Universitat Polit\u00e8cnica de Catalunya","host_organization_lineage":["https://openalex.org/I9617848"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"}],"best_oa_location":{"id":"pmh:oai:upcommons.upc.edu:2117/441585","is_oa":true,"landing_page_url":"https://hdl.handle.net/2117/441585","pdf_url":"https://upcommons.upc.edu/bitstreams/a97bf627-996c-4fd2-aca2-a54c9633013d/download","source":{"id":"https://openalex.org/S4377196262","display_name":"UPCommons institutional repository (Universitat Polit\u00e8cnica de Catalunya)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9617848","host_organization_name":"Universitat Polit\u00e8cnica de Catalunya","host_organization_lineage":["https://openalex.org/I9617848"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4413948892.pdf","grobid_xml":"https://content.openalex.org/works/W4413948892.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W1591987192","https://openalex.org/W1977943748","https://openalex.org/W2019003829","https://openalex.org/W2051257608","https://openalex.org/W2061651455","https://openalex.org/W2081269878","https://openalex.org/W2084224084","https://openalex.org/W2107056341","https://openalex.org/W2169528473","https://openalex.org/W2577865170","https://openalex.org/W2787991113","https://openalex.org/W2964247748","https://openalex.org/W3004995474","https://openalex.org/W3006484790","https://openalex.org/W3007023388","https://openalex.org/W3045703642","https://openalex.org/W3102518922","https://openalex.org/W3118621910","https://openalex.org/W3167919298","https://openalex.org/W3212378323","https://openalex.org/W4282027681","https://openalex.org/W4294204263","https://openalex.org/W4300482433","https://openalex.org/W4313054664","https://openalex.org/W4366782941","https://openalex.org/W4372046852","https://openalex.org/W4376474620","https://openalex.org/W4382203006","https://openalex.org/W4382240087","https://openalex.org/W4394062234","https://openalex.org/W4396817475","https://openalex.org/W4401024522","https://openalex.org/W4411331892"],"related_works":["https://openalex.org/W2018146256","https://openalex.org/W2040572217","https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2776102956","https://openalex.org/W2156967343","https://openalex.org/W2323352958","https://openalex.org/W2183811469","https://openalex.org/W2348504720"],"abstract_inverted_index":{"Traditionally,":[0],"route":[1],"recommendation":[2],"systems":[3],"focused":[4],"on":[5,220,249,285],"minimizing":[6],"distance":[7,113],"(or":[8],"time)":[9],"to":[10,20,69,114,148,223],"travel":[11],"between":[12],"two":[13],"points.":[14],"However,":[15],"recent":[16],"attention":[17],"has":[18],"shifted":[19],"other":[21],"factors":[22],"beyond":[23],"mere":[24],"length.":[25],"This":[26,198],"paper":[27],"addresses":[28],"the":[29,62,78,88,98,112,115,149,180,184,188,210,225,232,293,305],"challenge":[30],"of":[31,36,46,58,64,81,94,100,136,212,243,281,301],"ensuring":[32],"a":[33,43,55,71,133,157,173,194,217,241,286,298],"fair":[34],"distribution":[35,73,227],"visits":[37],"among":[38],"network":[39],"nodes":[40,142,282],"when":[41,295],"handling":[42],"high":[44],"volume":[45,300],"point-to-point":[47],"path":[48,165,267,302],"queries.":[49],"In":[50,117],"doing":[51],"so,":[52],"we":[53,67],"adopt":[54],"Rawlsian":[56],"notion":[57,99],"individual-level":[59],"fairness":[60,234],"exploiting":[61],"power":[63],"randomization.":[65],"Specifically,":[66],"aim":[68],"create":[70],"probabilistic":[72,226],"over":[74,228],"paths":[75,102,105,121,124,131,182,230],"that":[76,171,257,273],"maximizes":[77],"minimum":[79],"probability":[80],"any":[82,109],"eligible":[83],"node":[84,262],"being":[85],"included":[86],"in":[87,127,146,183,209,237],"recommended":[89],"path.":[90,151],"A":[91],"key":[92],"idea":[93],"our":[95,253,258,270,274],"work":[96],"is":[97,297],"forward":[101,120,130,181,203,229],",":[103],"i.e.,":[104],"where":[106],"travelling":[107],"along":[108],"edge":[110],"decreases":[111],"destination.":[116],"unweighted":[118],"graphs":[119,129],"and":[122,156,283,289,308],"shortest":[123,150],"coincide,":[125],"but":[126],"weighted":[128],"provide":[132],"richer":[134],"set":[135],"alternative":[137],"routes,":[138],"involving":[139],"many":[140],"more":[141],"while":[143,162,264],"remaining":[144],"close":[145],"length":[147],"Thus,":[152],"they":[153],"offer":[154],"diversity":[155],"wider":[158],"basis":[159],"for":[160,304],"fairness,":[161],"maintaining":[163,265],"near-optimal":[164,266],"lengths.":[166,268],"We":[167,214],"devise":[168],"an":[169],"algorithm":[170],"extracts":[172],"directed":[174],"acyclic":[175],"graph":[176],"(DAG)":[177],"containing":[178],"all":[179,201],"input":[185],"graph,":[186],"with":[187,231,279],"same":[189,306],"computational":[190],"runtime":[191],"as":[192],"solving":[193],"single":[195],"shortest-path":[196],"query.":[197],"avoids":[199],"enumerating":[200],"possible":[202],"paths,":[204],"which":[205],"can":[206,276],"be":[207],"exponential":[208],"number":[211],"nodes.":[213],"then":[215],"design":[216],"flow":[218],"problem":[219],"this":[221],"DAG":[222],"derive":[224],"desired":[233],"property,":[235],"solvable":[236],"polynomial":[238],"time":[239],"through":[240],"sequence":[242],"small":[244],"linear":[245],"programs.":[246],"Our":[247],"experiments":[248,271],"real-world":[250],"datasets":[251],"validate":[252],"theoretical":[254],"results,":[255],"demonstrating":[256],"technique":[259],"provides":[260],"individual":[261],"satisfaction":[263],"Moreover,":[269],"show":[272],"method":[275],"handle":[277],"networks":[278],"millions":[280],"edges":[284],"commodity":[287],"laptop,":[288],"scales":[290],"better":[291],"than":[292],"baselines":[294],"there":[296],"large":[299],"queries":[303],"source":[307],"destination":[309],"pair.":[310]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}