The relation of Connected Set Cover and Group Steiner Tree

详细信息	查看全文 | 推荐本文 |

• 作者：Khaled Elbassioni^a ; ¹ ; ^{elbassio@mpi-inf.mpg.de} ; Slobodan Jeli膰^b ; ^{sjelic@mathos.hr} ; ^{sljelic@gmail.com} ; Domagoj Matijevi膰^c ; ² ; ^{domagoj@mathos.hr}
• 关键词：Set cover ; Connected set cover ; Weighted connected set cover ; Group Steiner tree ; Node weighted group Steiner tree ; Covering Steiner tree problem
• 刊名：Theoretical Computer Science
• 出版年：2012
• 期刊代码：114_03043975
• 类别：cp
• 出版时间：22 June, 2012
• 卷：438
• 期：Complete
• 页码：96-101
• 文件大小：217 K

摘要

We report that the Connected Set Cover (CSC) problem is just a special case of the Group Steiner Tree (GST) problem. Based on that we obtain the first algorithm for CSC with polylogarithmic approximation guarantee as well as the first approximation algorithms for the weighted version of the problem and the version with requirements. Moreover, we argue that the inapproximability result of GST will carry on to the weighted version of the CSC problem.