Beyond Shortest Paths: Node Fairness in Route Recommendation
Summary: Proposes Rawlsian max–min individual fairness for route recommendation via randomized path distributions that maximize the minimum probability of any eligible node being visited. Key ideas: forward paths (near-shortest alternatives), DAG extraction in single shortest-path time, and a flow/LP-based polynomial solver to compute fair distributions at million-node scale. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Antonio Ferrara (CENTAI; Graz University of Technology)
- 2. David García-Soriano (Polytechnic University of Catalonia)
- 3. Francesco Bonchi (CENTAI; Eurecat)
BibTeX Citation
@article{ferrara_vldb25,
title = {{Beyond Shortest Paths: Node Fairness in Route Recommendation}},
author = {Ferrara, Antonio and García-Soriano, David and Bonchi, Francesco},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {9},
pages = {3230--3242},
doi = {10.14778/3746405.3746440},
url = {https://doi.org/10.14778/3746405.3746440},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,794 | Keyword-aware Optimal Route Search | 2012 | VLDB | 7.1200794e-05 |
| 4,807 | Diversified Top-k Route Planning in Road Network | 2022 | VLDB | 6.4992836e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,598 | Efficient Route Planning on Public Transportation Networks: A Labelling Approach | 2015 | SIGMOD |
| 2 | 1,205 | Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice | 2013 | SIGMOD |
| 3 | 5,678 | Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement | 2022 | VLDB |
| 4 | 6,683 | Efficient Algorithms for Optimal Location Queries in Road Networks | 2014 | SIGMOD |
| 5 | 5,208 | Efficient Shortest Path Counting on Large Road Networks | 2022 | VLDB |
| 6 | 949 | Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation | 2012 | VLDB |
| 7 | 9,062 | Shortest Paths Discovery in Uncertain Networks via Transfer Learning | 2023 | SIGMOD |
| 8 | 5,889 | Shortest Paths and Centrality in Uncertain Networks | 2021 | VLDB |
| 9 | 9,848 | Maximizing Fair Content Spread via Edge Suggestion in Social Networks | 2022 | VLDB |
| 10 | 4,807 | Diversified Top-k Route Planning in Road Network | 2022 | VLDB |