Best Upgrade Plans for Single and Multiple Source-Destination Pairs

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

全面介紹

Saved in:
書目詳細資料
Main Authors: Lin, Yimin, MOURATIDIS, Kyriakos
格式: text
語言:English
出版: Institutional Knowledge at Singapore Management University 2015
主題:
在線閱讀: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
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Singapore Management University
語言: English