We show that both the reverse problems are stronglyNP-hard.
我们将证明这两个逆网络选址问题都是强np困难的。
2
For no-waited model, we show it is stronglyNP-hard, and present a pseudo-polynomial time optimal algorithm and an approximation algorithm with worst-case ratio 5/3.