By Topic

A fast approximation algorithm for maximum-leaf spanning tree

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hsueh-I Lu ; Dept. of Comput. Sci., Nat. Chung-Cheng Univ., Chia-Yi, Taiwan ; Ravi, R.

Given an undirected graph G, finding a spanning tree of G with maximum number of leaves is not only NP-complete but also MAX SNP-complete. The approximation ratio of the previously best known approximation algorithm for maximum leaf spanning tree is three. However, the high-order running time required by the previous algorithm makes it impractical. In this paper we give a new factor-three approximation algorithm for the same problem. The running time O((m+n)α(m, n)) required by our algorithm is almost linear in the size of G, where m is the number of edged and n is the number of nodes. This improves the previous algorithm by a factor of Ω˜(mn 4)

Published in:

Parallel Architectures, Algorithms, and Networks, 1997. (I-SPAN '97) Proceedings., Third International Symposium on

Date of Conference:

18-20 Dec 1997