Proceedings of the 41st Annual Hawaii International Conference on System Sciences (HICSS 2008) (2008)

Waikoloa, Big Island, Hawaii

Jan. 7, 2008 to Jan. 10, 2008

ISSN: 1530-1605

ISBN: 0-7695-3075-3

pp: 472

ABSTRACT

Given an edge-weighted tree T, a k-trunk is a subtree Tk with k leaves in T which minimizes the sum of the distances of all vertices in T from Tk plus the weight of Tk. In this paper, we first give motivation for using a k-trunk in tree networks. Then we develop efficient algorithms for finding a k-trunk of T. The first algorithm is a sequential algorithm which runs in O(n) time, where n is the number of vertices in T. The second algorithm is a parallel algorithm which runs in O(log n) time using O(n/ log n) processors on EREW PRAM model.

INDEX TERMS

null

CITATION

S. Peng, Y. Li and W. Chu, "K-Trunk and Efficient Algorithms for Finding a K-Trunk on a Tree Network,"

*Proceedings of the 41st Annual Hawaii International Conference on System Sciences (HICSS 2008)(HICSS)*, Waikoloa, Big Island, Hawaii, 2008, pp. 472.

doi:10.1109/HICSS.2008.505

CITATIONS