Best Upgrade Plans for Large Road Networks


In this paper, we consider a new problem in the context of road network databases, named Resource Constrained Best Upgrade Plan computation (BUP, for short). 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… (More)
DOI: 10.1007/978-3-642-40235-7_13


11 Figures and Tables