The Partial Inverse Least Uniform Spanning Tree Problem under Weighted l1 Norm

摘要：

In this paper, we consider the partial inverse least uniform spanning tree problem under weighted l1 norm, which is how to adjust the parameters with the minimum cost in a simple undirected weighted graph so that a partially given forest becomes a part of the new least uniform spanning tree. We shall show that this problem can be solved by strongly polynomial algorithm.

关键词： partial inverse problem least uniform spanning tree computational complezity strongly polynomial time algorithm

作者: Qin Wang Qian Yu Yunsheng Yan

作者单位: Department of Mathematics, China Jiliang University, Zhejiang 310018, P.R. China College of Science, Henan University of Technology, Henan 450052, P.R. China

会议类型: 国际会议

会议名称: The First World Congress on Global Optimization in Engineering & Science(第一届工程与科学全局优化国际会议 WCGO2009)

会议地点: 长沙

会议语种:英文

页码: 894-900

在线出版日期: 2009-06-01（万方平台首次上网日期，不代表论文的发表时间）