Abstract: Motivated by multi-domain Service Function Chain (SFC) orchestration, we define the Shortest-Longest Path (SLP) problem, prove its hardness, and design an efficient Fully Polynomial Time ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results