Subscribe

Los Angeles, CA

March 31, 2009 to April 2, 2009

ISBN: 978-0-7695-3507-4

pp: 691-695

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.336

ABSTRACT

Motivated by various network improvement models, we study the problem to add some new edges to satisfy the increasing information demand and keep the underlying structure of the networks unchanged. In this paper we propose the general network expansion problem on the spanning tree in graphs (GNEST), then we present the polynomial equivalence between the GNEST problem and the constrained minimum spanning tree problem (CST), which indicates the GNEST problem is NP-hard. By utilizing an algorithm[5] to solve the CST problem, we can design a PTAS to solve the GNEST problem, and the computational complexity is the same as that of the algorithm given in [5]. Finally we study two special versions of the GNEST problem:the minimum network expansion on spanning tree problem(MNEST) and the minimum-cost network expansion on spanning tree (MCNEST). We design two polynomial-time algorithms to solve these two new problems. To solve the MNEST problem we use T-exchange method on spanning trees. To find the optimal solution of the MCNEST problem,we utilize lexicographical order and modify Sollin’s algorithm to find the minimum spanning tree as required.

INDEX TERMS

spanning tree; network expansion; strongly

CITATION

Jianping Li,
Juanping Zhu,
"Network Expansion Problem on the Spanning Tree in Graphs",

*CSIE*, 2009, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009, pp. 691-695, doi:10.1109/CSIE.2009.336