On the Complexity of the Regenerator Placement Problem in Optical Networks
Placement of regenerators in optical networks has attracted the attention of recent research works in optical networks. In this problem, the authors are given a network with an underlying topology of a graph and with a set of requests that correspond to paths in. There is a need to put a regenerator every certain distance, because of a decrease in the power of the signal. In this paper, they investigate the problem of minimizing the number of locations to place the regenerators.