Inapproximability and approximability of maximal tree routing and coloring

doi:10.1007/s10878-006-7135-8

CSpace > 应用数学研究所

	Inapproximability and approximability of maximal tree routing and coloring
	Chen, XJ; Hu, XD; Shuai, T
	2006-03-01
发表期刊	JOURNAL OF COMBINATORIAL OPTIMIZATION
ISSN	1382-6905
卷号	11 期号:2 页码:219-229
摘要	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.
关键词	multicast routing coloring maximum independent set
DOI	10.1007/s10878-006-7135-8
语种	英语
WOS研究方向	Computer Science ; Mathematics
WOS类目	Computer Science, Interdisciplinary Applications ; Mathematics, Applied
WOS记录号	WOS:000236792900008
出版者	SPRINGER
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/2726
专题	应用数学研究所
通讯作者	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.