Single Commodity Flow Requirements
In this chapter we consider the minimum network synthesis problem with non-simultaneous single commodity flow requirements (or NSSC for short). We distinguish between the two applications of this problem, namely the restoration and the multi-hour applications, since we prove that some classes do not have the same complexity. As the multi-hour problem was covered by Gomory and Hu  , and by Sridhar and Chandrasekaran , we mainly study the Line Restoration (LR) problem.
KeywordsSteiner Tree Hamiltonian Cycle Steiner Tree Problem Star Graph Solution Graph
Unable to display preview. Download preview PDF.