We show that both the reverse problems are strongly NP-hard.

我们将证明这两个逆网络选址问题都是强np困难的。

youdao

For no-waited model, we show it is strongly NP-hard, and present a pseudo-polynomial time optimal algorithm and an approximation algorithm with worst-case ratio 5/3.

对于不可等待的情况证明了它是强NP-难的，并给出了动态规划算法和一个最坏情况界为5/3的近似算法。

youdao