Upgrading arc problem with budget constraint

Authors:
Li Zhang
Affiliations:
The Citadel, Charleston, SC
Venue:
Proceedings of the 43rd annual Southeast regional conference - Volume 1
Year:
2005

Citing 4
Cited 2

Accumulation point location on tree networks for guaranteed time distribution

Management Science
Extended stuck-fault testability for combinational networks

AUSCRYPT '90 Proceedings of the sixth MIT conference on Advanced research in VLSI
Algorithms for library-specific sizing of combinational logic

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Upgrading arcs are often used in transportation and telecommunication systems. In a real world situation, upgrading an arc between a pair of nodes corresponds to using a rapid mode of transit, such as using a plane instead of a truck between a pair of cities in a transportation network or using a higher speed cable between a pair of servers in a telecommunication network. These upgrades decrease transportation times through the network and can be critical in achieving delivery deadlines. This paper introduces and analyzes the upgrading arc problem with budget constraint. We show that this problem is NP-Complete in general and present several polynomially solvable cases.