Best Upgrade Plans for Single and Multiple Source-Destination Pairs

• المؤلفون الرئيسيون: Lin, Yimin, MOURATIDIS, Kyriakos
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2015
• الموضوعات: Road network; Resource constraint; Network upgrade; Computer Sciences; Databases and Information Systems; Numerical Analysis and Scientific Computing
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/sis_research/2274; https://ink.library.smu.edu.sg/context/sis_research/article/3274/viewcontent/Best_Upgrade_Plans_for_Single_and_Multiple_Source_Destination_Pairs.pdf

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...