科研之友
微信
新浪微博
Facebook
分享链接
摘要
This paper considers a selfish routing based network improvement problem, in which the authors would like to find a modified latency function that results in a new Nash equilibrium flow satisfying all traffic demands subject to the target capacity, while the total modification cost on edge latency is minimized. By using the reduction from the 3-Satisfiability (3-SAT) problem to our problem, the authors show that this problem is strongly NP-hard, even for the single commodity network.
