Partial inverse maximum spanning tree in which weight can only be decreased under $$l_p$$-norm |
| |
| Authors: | Xianyue Li Zhao Zhang Ding-Zhu Du |
| |
| Institution: | 1.School of Mathematics and Statistics,Lanzhou University,Lanzhou,People’s Republic of China;2.College of Mathematics Physics and Information Engineering,Zhejiang Normal University,Jinhua,People’s Republic of China;3.Department of Computer Science,University of Texas at Dallas,Richardson,USA |
| |
| Abstract: | The maximum or minimum spanning tree problem is a classical combinatorial optimization problem. In this paper, we consider the partial inverse maximum spanning tree problem in which the weight function can only be decreased. Given a graph, an acyclic edge set, and an edge weight function, the goal of this problem is to decrease weights as little as possible such that there exists with respect to function containing the given edge set. If the given edge set has at least two edges, we show that this problem is APX-Hard. If the given edge set contains only one edge, we present a polynomial time algorithm. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
