%0 Journal Article
%T COMPLEXITY OF TWO REVERSE NETWORK LOCATION PROBLEMS<br>两个逆网络选址问题的计算复杂性
%A Yang Xiaoguang
%A <br>杨晓光
%A 张建中
%A 蔡茂诚
%J 系统科学与数学
%D 2002
%I 
%X The paper discusses two network improvement problems which we call the reverse network location problems. They are to change the lengths of the edges of the network to ensure that the maximal distance from a given vertex to other vertices is not bigger than a given upper bound, or the sum of distances from a given vertex to other vertices is not bigger than a given upper bound; and the total changes are minimum. We show that both the reverse problems are strongly NP-hard.
%K Network location
%K reverse problem
%K strongly NP-hard<br>网络选址
%K 逆问题
%K 强NP困难
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=EB1ECD6993B61A5E&yid=C3ACC247184A22C1&vid=BC12EA701C895178&iid=38B194292C032A66&sid=4AD4BA66429F5627&eid=170CE8B011EA4FD9&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=6&reference_num=6