A Set of Inverse Telecommunication Network Problems
In this paper,we consider a set of inverse telecommunication network problem under l∞ norm.With the expansion of telecommunication network,more and more links and nodes will be added to the existed telecommunication network.The original network can not cover new nodes and some old links become useless.The telecommunication company wants to sell some old links and purchase some new links within a given budget,such that the network of the company is able to access all nodes.We consider the inverse problem by using weakly dominant set,which is to change the weights of the edges as little as possible such that the given edge set becomes a weakly dominant set under the new weights.In this paper,we propose a polynomial time algorithm for the inverse problem under l∞ norm,and we also present an example to illustrate the algorithm.
Weakly dominant set inverse problem telecommunication network
Zheheng Ding Jing Wang Qin Wang
Department of Mathematics,China Jiliang University,Hangzhou 310018,China Department of Information Engineering,Beijing Information Technology College,Beijing 100018,China
国际会议
郑州
英文
2101-2104
2013-10-19（万方平台首次上网日期，不代表论文的发表时间）