Inapproximability and approximability of maximal tree routing and coloring
文献类型：期刊论文
| 作者 | Chen, XJ ; Hu, XD; Shuai, T
|
| 刊名 | JOURNAL OF COMBINATORIAL OPTIMIZATION
 |
| 出版日期 | 2006-03-01 |
| 卷号 | 11期号:2页码:219-229 |
| 关键词 | multicast routing coloring maximum independent set |
| ISSN号 | 1382-6905 |
| DOI | 10.1007/s10878-006-7135-8 |
| 英文摘要 | Let G be a undirected connected graph. Given g groups each being a subset of V(G) and a number of colors, we consider how to find a subgroup of subsets such that there exists a tree interconnecting all vertices in each subset and all trees can be colored properly with given colors (no two trees sharing a common edge receive the same color); the objective is to maximize the number of subsets in the subgroup. This problem arises from the application of multicast communication in all optical networks. In this paper, we first obtain an explicit lower bound on the approximability of this problem and prove Omega(g(1-epsilon))-inapproximability even when G is a mesh. We then propose a simple greedy algorithm that achieves performance ratio O(root vertical bar E(G)vertical bar), which matches the theoretical bounds. |
| WOS研究方向 | Computer Science ; Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000236792900008 |
| 出版者 | SPRINGER |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/2725]  |
| 专题 | 应用数学研究所 |
| 通讯作者 | Chen, XJ |
| 作者单位 | Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Chen, XJ,Hu, XD,Shuai, T. Inapproximability and approximability of maximal tree routing and coloring[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION,2006,11(2):219-229. |
| APA | Chen, XJ,Hu, XD,&Shuai, T.(2006).Inapproximability and approximability of maximal tree routing and coloring.JOURNAL OF COMBINATORIAL OPTIMIZATION,11(2),219-229. |
| MLA | Chen, XJ,et al."Inapproximability and approximability of maximal tree routing and coloring".JOURNAL OF COMBINATORIAL OPTIMIZATION 11.2(2006):219-229. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。