| 哈明距离下极大不一致支撑树的部分逆问题 |
| |
| 引用本文： | 于倩,王勤,白艳琴. 哈明距离下极大不一致支撑树的部分逆问题[J]. 中国计量学院学报, 2010, 21(3) |
| |
| 作者姓名： | 于倩 王勤 白艳琴 |
| |
| 作者单位： | 中国计量学院,理学院,浙江,杭州,310018 |
| |
| 基金项目： | 国家自然科学基金资助项目，浙江省自然科学基金资助项目 |
| |
| 摘 要： | 给定一个简单无向赋权图和其中的一个森林,极大不一致支撑树的部分逆问题研究如何尽可能少地改变图中各边的权,使得在新的权值下存在一个极大不一致支撑树包含该森林.在赋权哈明距离下,得到了该问题的一些性质,并且给出了求解该问题的多项式时间算法.
|
| 关 键 词： | 部分逆问题 极大不一致支撑树 哈明距离 多项式时间算法 |
The partial inverse least uniform spanning tree problem under hamming distance |
| |
| YU Qian,WANG Qin,BAI Yan-qin. The partial inverse least uniform spanning tree problem under hamming distance[J]. Journal of China Jiliang University, 2010, 21(3) |
| |
| Authors: | YU Qian WANG Qin BAI Yan-qin |
| |
| Affiliation: | YU Qian; WANG Qin; BAI Yan-qin (College of Sciences; China Jiliang University; Hangzhou 310018; China); |
| |
| Abstract: | The objective of a partial inverse optimization problem was to find a minimum perturbation of the parameter values,in an underlying optimization problem with a partially given solution,such that the partial solution become a part of the optimal solution under the new parameters.Given a simple undirected weighted graph and a forest,the partial inverse least uniform spanning tree problem was how to adjust the weights of the edges as small as possible so that the partially given forest is contained in a new le... |
| |
| Keywords: | partial inverse problem least uniform spanning tree hamming distance polynomial time algorithm |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
