Olaf E. Flippo

Learn More
In this paper we consider the local access telecommunication network expansion problem, in which growing demand can be satis®ed by expanding cable capacities and/or installing concentrators in the network. The problem is known to be NP-hard. We prove that the problem is weakly NP-hard, and present a pseudo-polynomial dynamic programming algorithm for the(More)
  • 1