Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
Introduction to algorithms
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
IEEE Transactions on Knowledge and Data Engineering
Resource Constrained Shortest Paths
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Nearest neighbor queries in road networks
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Efficiency Loss in a Network Resource Allocation Game
Mathematics of Operations Research
Upgrading arc problem with budget constraint
Proceedings of the 43rd annual Southeast regional conference - Volume 1
On investigating overlay service topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Overlay Node Placement: Analysis, Algorithms and Impact on Applications
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Continuous range monitoring of mobile objects in road networks
Data & Knowledge Engineering
Finding time-dependent shortest paths over large graphs
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Hierarchical Graph Embedding for Efficient Query Processing in Very Large Traffic Networks
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Optimization models for the radio planning of wireless mesh networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
An efficient Nash-implementation mechanism for network resource allocation
Automatica (Journal of IFAC)
Models and Algorithms for the Design of Service Overlay Networks
IEEE Transactions on Network and Service Management
A simple efficient approximation scheme for the restricted shortest path problem
Operations Research Letters
| Hi-index | 0.00 |
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 specific new value. Given a source and a destination in G, and a budget (resource constraint) B, the BUP problem is to identify which upgradable edges should be upgraded so that the shortest path distance between source and destination (in the updated network) is minimized, without exceeding the available budget for the upgrade. In addition to transportation networks, the BUP query arises in other domains too, such as telecommunications. We propose a framework for BUP processing and evaluate it with experiments on large, real road networks.