手机知网 App
24小时专家级知识服务
打 开
数学
Minimizing Maximum Risk for Fair Network Connection with Interval Data
 
<正>In this paper we introduce a minimax model for network connection problems with interval parameters. We consider how to connect given nodes in a network with a path or a spanning tree under a given budget,where each link is associated with an interval and can be established at a cost of any value in the interval.The quality of an individual link(or the risk of link failure,etc.) depends on its construction cost and associated interval.To achieve fairness of the network connection,our model aims at the minimization of the maximum risk over all links used.We propose two algorithms that find optimal paths and spanning trees in polynomial time,respectively.The polynomial solvability indicates salient difference between our minimax model and the model of robust deviation criterion for network connection with interval data,which gives rise to NP-hard optimization problems.
2 72
手机阅读本文
下载APP 手机查看本文
Acta Mathematicae Applicatae Sinica(English Series)
2010年01期

搜 索