Remark 6.3 
Let us compare this with the polynomial time algorithm given in
[1]} (whose statement does not give a
precise exponent). That algorithm ultimately proceeds by the following
sequence of reductions:
\( \text{PC directed trail} \longrightarrow \text{minimum reload+weightdirected trail} \longrightarrow \text{shortest weighted path/trail} \) 
