Best upgrade plans for single and multiple source-destination pairs

@article{Lin2015BestUP,
  title={Best upgrade plans for single and multiple source-destination pairs},
  author={Yimin Lin and Kyriakos Mouratidis},
  journal={GeoInformatica},
  year={2015},
  volume={19},
  pages={365-404}
}
In this paper, we study Resource Constrained Best Upgrade Plan (BUP) computation in road network databases. Consider a transportation network (weighted graph) G where a subset of the edges are upgradable, i.e., for each such edge there is a cost, which if spent, the weight of the edge can be reduced to a specific new value. In the single-pair version of BUP, the input includes a source and a destination in G, and a budget B (resource constraint). The goal is to identify which upgradable edges… CONTINUE READING