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 ...
A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback