Expanding Reverse Nearest Neighbors
Summary: ERNN: choose up to k edge weight reductions to maximize a facility's reverse nearest neighbor set; problem is NP-hard, APX-hard, non‑monotone and non‑submodular. Propose greedy heuristics that prune edges and cut per‑edge cost, giving orders‑of‑magnitude speedups and large RNN gains. (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
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 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 601 | Influence Sets Based on Reverse Nearest Neighbor Queries | 2000 | SIGMOD | 0.00019375875 |
| 3,071 | Efficient Method for Maximizing Bichromatic Reverse Nearest Neighbor | 2009 | VLDB | 7.6120001e-05 |
| 4,621 | Diversified Top-k Route Planning in Road Network | 2022 | VLDB | 6.0426586e-05 |
| 5,597 | Efficient Shortest Path Counting on Large Road Networks | 2022 | VLDB | 5.4178241e-05 |
| 5,941 | Big Graphs: Challenges and Opportunities | 2022 | VLDB | 5.2635446e-05 |
| 6,503 | Progressive Top-K Nearest Neighbors Search in Large Road Networks | 2020 | SIGMOD | 5.0357715e-05 |
| 6,530 | Fast Algorithms for Core Maximization on Large Graphs | 2022 | VLDB | 5.0246792e-05 |
| 7,348 | Public Transport Planning: When Transit Network Connectivity Meets Commuting Demand | 2021 | SIGMOD | 4.7554541e-05 |
| 7,462 | Maximizing Bichromatic Reverse Spatial and Textual k Nearest Neighbor Queries | 2016 | VLDB | 4.7233035e-05 |
| 8,761 | Noticeable Network Delay Minimization via Node Upgrades | 2018 | VLDB | 4.456315e-05 |
Previous
Page 1 / 1
Next