Managing traffic growth in solar powered wireless mesh networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Best upgrade plans for large road networks
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
| Hi-index | 0.00 |
In transportation and telecommunication systems, the performance of the underlying network can often be improved by upgrading some of the arcs in the network. If an arc is upgraded, the travel time along this arc is reduced by a discount factor α, 0 ≤ α q arcs in a network to upgrade. We show that these problems are NP-hard on general graphs, but polynomially solvable on trees. Finally, we compare three heuristic solution approaches for complete graphs based on these polynomial results and find one to far outperform the others. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 47(2), 72–80 2006