Approximation algorithms for the maximum weight internal spanning tree problem

doi:10.1007/978-3-319-62389-4_11

科研成果详情

题名	Approximation algorithms for the maximum weight internal spanning tree problem
作者	Chen，Zhi Zhong 1; Lin，Guohui 2; Wang，Lusheng 3; Chen，Yong 2; Wang，Dan 3
发表日期	2017
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN	0302-9743
卷号	10392 LNCS
页码	124-136
摘要	Given a vertex-weighted connected graph G = (V, E), the maximum weight internal spanning tree (MwIST for short) problem asks for a spanning tree T of G such that the total weight of the internal vertices in T is maximized. The unweighted variant, denoted as MIST, is NP-hard and APX-hard, and the currently best approximation algorithm has a proven performance ratio 13/17. The currently best approximation algorithm for MwIST only has a performance ratio 1/3 - \epsilon , for any \epsilon > 0. In this paper, we present a simple algorithm based on a novel relationship between MwIST and the maximum weight matching, and show that it achieves a better approximation ratio of 1/2. When restricted to claw-free graphs, a special case been previously studied, we design a 7/12-approximation algorithm.
关键词	Approximation algorithm Maximum weight internal spanning tree Maximum weight matching Performance analysis
DOI	10.1007/978-3-319-62389-4_11
URL	查看来源
语种	英语English
Scopus入藏号	2-s2.0-85028473531
引用统计
文献类型	会议论文
条目标识符	https://repository.uic.edu.cn/handle/39GCC9TT/13128
专题	个人在本单位外知识产出
作者单位	1.Division of Information System Design,Tokyo Denki University,Hatoyama,350-0394,Japan 2.Department of Computing Science,University of Alberta,Edmonton,T6G 2E8,Canada 3.Department of Computer Science,City University of Hong Kong,Kowloon,Tat Chee Avenue,Hong Kong
推荐引用方式 GB/T 7714	Chen，Zhi Zhong,Lin，Guohui,Wang，Lushenget al. Approximation algorithms for the maximum weight internal spanning tree problem[C], 2017: 124-136.